CS264: Homework #4 Due by midnight on Wednesday, October 22, 2014 Instructions: (1) Form a group of 1-3 students. You should turn in only one write-up for your entire group. (2) Turn in your solutions at http://rishig.sc

Source URL: theory.stanford.edu

• NP-complete problems
• Vertex cover
• Maximum cut
• Dynamic programming
• Algorithm
• Kernelization
• Approximation algorithm

Benny Y C Hon (City Univ. of Hong Kong) Global-local-integration-based kernel approximation methods August 8 (Mon) 16:30 〜 17:30 Room 128

Source URL: fmsp.ms.u-tokyo.ac.jp

Maximal Strip Recovery Problem with Gaps: Hardness and Approximation AlgorithmsI Laurent Bulteau, Guillaume Fertin, Irena Rusu Laboratoire d’Informatique de Nantes-Atlantique (LINA), UMR CNRS 6241 Université de Nantes

Source URL: pagesperso.lina.univ-nantes.fr

• Computational problems
• NP-complete problems
• Optimization problem
• Synteny
• Independent set

A 3/4-Approximation Algorithm for Maximum ATSP with Weights Zero and One Markus Bl¨ aser Institut f¨ ur Theoretische Informatik, ETH Z¨

Source URL: www-cc.cs.uni-saarland.de

• Graph theory
• Degree
• Multigraph
• Eulerian path
• Directed graph
• Bipartite graph
• Graph
• Travelling salesman problem
• Matching

Constructive Discrepancy Minimization for Convex Sets Thomas Rothvoss UW Seattle Discrepancy theory

Source URL: www.math.washington.edu

• Diophantine approximation
• Graph coloring
• Combinatorics
• Discrepancy theory
• Measure theory

CS264: Beyond Worst-Case Analysis Lecture #5: Computing Independent Sets: A Parameterized Analysis ∗ Tim Roughgarden† October 8, 2014

Source URL: theory.stanford.edu

• NP-complete problems
• Approximation algorithm
• Independent set
• Algorithm
• Maximal independent set
• Longest path problem
• Vertex cover

C:/rump/Publikationen/Rump_Veroeff/Affine/revised/AffineRevised.dvi

Source URL: www.ti3.tu-harburg.de

• Numerical analysis
• Limit of a function
• Affine arithmetic
• Taylor series
• Interval arithmetic
• Error function
• Affine connection
• Approximation theory

Algorithms as Mechanisms: The Price of Anarchy of Relax-and-Round ¨ PAUL DUTTING, ETH Z¨ urich

Source URL: paulduetting.com

• Operations research
• Approximation algorithm
• Randomized rounding
• Greedy algorithm
• Algorithm
• Relaxation
• Combinatorial auction
• Price of anarchy
• Linear programming
• Travelling salesman problem
• Integer programming
• Semidefinite programming

c 2008 Society for Industrial and Applied Mathematics
SIAM REVIEW Vol. 50, No. 1, pp. 67–87

Source URL: people.maths.ox.ac.uk

• Numerical integration
• ClenshawCurtis quadrature
• Gaussian quadrature
• Chebyshev polynomials
• NewtonCotes formulas
• Approximation theory
• Integral
• Polynomial interpolation
• Fourier transform
• Numerical analysis
• Adaptive quadrature
• GaussKronrod quadrature formula