Approximation on the web: A compendium of NP optimization problems
- 1 January 1997
- book chapter
- Published by Springer Nature
- p. 111-118
- https://doi.org/10.1007/3-540-63248-4_10
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Approximation algorithms for combinatorial problemsPublished by Elsevier ,2007
- Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUTPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Some optimal inapproximability resultsPublished by Association for Computing Machinery (ACM) ,1997
- On dependent randomized rounding algorithmsLecture Notes in Computer Science, 1996
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programmingJournal of the ACM, 1995
- Structure in approximation classesPublished by Springer Nature ,1995
- The hardness of approximation: Gap locationcomputational complexity, 1994
- Optimization, approximation, and complexity classesJournal of Computer and System Sciences, 1991
- On the $1.1$ Edge-Coloring of MultigraphsSIAM Journal on Discrete Mathematics, 1990
- The NP-Completeness of Edge-ColoringSIAM Journal on Computing, 1981