Randomized rounding: a technique for provably good algorithms and algorithmic proofs
Combinatorica - Theory of Computing
A catalog of complexity classes
Handbook of theoretical computer science (vol. A)
Approximating clique is almost NP-complete (preliminary version)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
On the hardness of approximating minimization problems
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Approximate max-flow min-(multi)cut theorems and their applications
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
.879-approximation algorithms for MAX CUT and MAX 2SAT
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
A threshold of ln n for approximating set cover (preliminary version)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Approximation algorithms for NP-hard problems
The hardness of approximate optima in lattices, codes, and systems of linear equations
Journal of Computer and System Sciences - Special issue: papers from the 32nd and 34th annual symposia on foundations of computer science, Oct. 2–4, 1991 and Nov. 3–5, 1993
Some optimal inapproximability results
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Probabilistic checking of proofs: a new characterization of NP
Journal of the ACM (JACM)
Proof verification and the hardness of approximation problems
Journal of the ACM (JACM)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
An O(log*n) approximation algorithm for the asymmetric p-center problem
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
A polylogarithmic approximation algorithm for the group Steiner tree problem
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
Journal of the ACM (JACM)
Approximating the domatic number
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
The importance of being biased
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Relations between average case complexity and approximation complexity
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
On the power of unique 2-prover 1-round games
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
The Approximability of Constraint Satisfaction Problems
SIAM Journal on Computing
On Approximating the Radii of Point Sets in High Dimensions
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Polylogarithmic inapproximability
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Some complexity results for the Traveling Salesman Problem
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Clique is hard to approximate within n1-
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Approximation algorithms for disjoint paths problems
Approximation algorithms for disjoint paths problems
On the hardness of approximating label-cover
Information Processing Letters
Expander flows, geometric embeddings and graph partitioning
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Asymmetric k-center is log* n-hard to approximate
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
New hardness results for congestion minimization and machine scheduling
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Approximating Maximum Clique by Removing Subgraphs
SIAM Journal on Discrete Mathematics
Ruling Out PTAS for Graph Min-Bisection, Densest Subgraph and Bipartite Clique
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Optimal Inapproximability Results for Max-Cut and Other 2-Variable CSPs?
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Hardness of the undirected congestion minimization problem
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Euclidean distortion and the sparsest cut
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Guest column: inapproximability results via Long Code based PCPs
ACM SIGACT News
On the Hardness of Approximating Multicut and Sparsest-Cut
CCC '05 Proceedings of the 20th Annual IEEE Conference on Computational Complexity
Noise stability of functions with low in.uences invariance and optimality
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
A greedy approximation algorithm for the group Steiner problem
Discrete Applied Mathematics
Near-optimal algorithms for unique games
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Logarithmic hardness of the directed congestion minimization problem
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Linear degree extractors and the inapproximability of max clique and chromatic number
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
A better approximation ratio for the vertex cover problem
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Efficient exact algorithms on planar graphs: exploiting sphere cut branch decompositions
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Better inapproximability results for maxclique, chromatic number and min-3lin-deletion
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
| Hi-index | 0.00 |
This is the 25th edition of a column that covers new developments in the theory of NP-completeness. The presentation is modeled on that which M. R. Garey and I used in our book Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman & Co., New York, 1979, hereinafter referred to as “[G&J].” Previous columns, the first 23 of which appeared in Journal of Algorithms, will be referred to by a combination of their sequence number and year of appearance, for example, [Col 1, 1981]. Full bibliographic details on the previous columns as well as downloadable unofficial versions of them can be found at http://www.reseach.att.com/~dsj/columns/. This edition of the column discusses the wide range of lower bounds on approximation guarantees for NP-hard optimization problems both in their functional forms and in the hypotheses on which they depend.