The G¨odel Prize 2010 Laudatio for S. Arora and J.S.B. Mitchell The G¨odel Prize 2010 is awarded to Sanjeev Arora and Joseph S.B. Mitchell for their concurrent discovery of a polynomial-time approximation scheme (PTAS)

Source URL: eatcs.org

A Polynomial-Time Approximation Scheme for Maximum Quartet Compatibility

Source URL: tandy.cs.illinois.edu

• Computational complexity theory
• Theory of computation
• Complexity classes
• NP-complete problems
• Combinatorial optimization
• Packing problems
• Approximation algorithms
• Knapsack problem
• NP
• APX

Truthful Approximation Schemes for Single-Parameter Agents∗ Peerapong Dhangwatnotai† Shahar Dobzinski‡ Shaddin Dughmi§

Source URL: theory.stanford.edu

• Computational complexity theory
• Mathematics
• Theory of computation
• Analysis of algorithms
• Scheduling
• Polynomial-time approximation scheme
• Makespan
• Time complexity
• Partition
• Randomized algorithm
• Algorithm
• Integral

A PTAS for the Highway Problem Fabrizio Grandoni & Thomas Rothvo Institute of Mathemati s EPFL, Lausanne The Highway Problem

Source URL: www.math.washington.edu

• Computational complexity theory
• Complexity classes
• Theory of computation
• Polynomial-time approximation scheme
• APX
• Strong NP-completeness
• NP

Bin Pa king via Dis repan y of Permutations F. Eisenbrand, D. Palv olgyi & T. Rothvo Cargese Workshop 2010

Source URL: www.math.washington.edu

• Computational complexity theory
• Theory of computation
• Complexity classes
• Strong NP-completeness
• Polynomial-time approximation scheme
• Bin
• Packing problems
• NP-complete problems
• Bin packing problem

CS264: Homework #8 Due by midnight on Wednesday, November 19, 2014 Instructions: (1) Students taking the course pass-fail should complete the exercises. Students taking the course for a letter grade should also complete

Source URL: theory.stanford.edu

• Computational complexity theory
• Operations research
• Theory of computation
• Mathematics
• Knapsack problem
• Optimization problem
• NP
• Mathematical optimization
• Polynomial-time approximation scheme
• Dynamic programming
• Time complexity
• Isolation lemma

Approximating the least hypervolume contributor: NP-hard in general, but fast in practice Karl Bringmann1 and Tobias Friedrich2 1

Source URL: people.mpi-inf.mpg.de

• Computational complexity theory
• Theory of computation
• Complexity classes
• Approximation algorithms
• Computational hardness assumptions
• Polynomial-time approximation scheme
• Time complexity
• NC
• Reduction
• Exponential time hypothesis
• NP-hardness
• NP

Approximating the volume of unions and intersections of high-dimensional geometric objects Karl Bringmann1 and Tobias Friedrich2,3 1

Source URL: people.mpi-inf.mpg.de

• Computational complexity theory
• Theory of computation
• Complexity classes
• Polynomial-time approximation scheme
• BPP
• Time complexity
• NP
• NC

Approximating the volume of unions and intersections of high-dimensional geometric objects Karl Bringmann Tobias Friedrich

Source URL: people.mpi-inf.mpg.de

• Mathematical analysis
• Mathematics
• Approximation algorithms
• Polynomial-time approximation scheme
• Pi
• NP-hard problems
• -net

CS264: Beyond Worst-Case Analysis Lecture #15: Smoothed Complexity and Pseudopolynomial-Time Algorithms∗ Tim Roughgarden† November 5, 2014

Source URL: theory.stanford.edu

• Computational complexity theory
• Theory of computation
• Operations research
• Complexity classes
• Combinatorial optimization
• Analysis of algorithms
• Knapsack problem
• Simplex algorithm
• Time complexity
• Optimization problem
• NP
• Polynomial-time approximation scheme