How to find the best approximation results

@article{Crescenzi1998HowTF,
  title={How to find the best approximation results},
  author={P. Crescenzi and V. Kann},
  journal={SIGACT News},
  year={1998},
  volume={29},
  pages={90-97}
}
  • P. Crescenzi, V. Kann
  • Published 1998
  • Computer Science
  • SIGACT News
  • A compendium of NP optimization problems, containing the best approximation results known for each problem, is available on the world wide web at http://www.nada.kth.se/~viggo/problemlist/In this paper we describe the compendium, and specify how the compendium is consultable as well as modifiable on the web. We also give statistics for the use of the compendium. 
    15 Citations

    Figures, Tables, and Topics from this paper.

    Explore Further: Topics Discussed in This Paper

    Who is interested in algorithms and why?: lessons from the Stony Brook algorithms repository
    • 34
    • Highly Influenced
    • PDF
    On Efficient Fixed Parameter Algorithms for WEIGHTED VERTEX COVER
    • 92
    • PDF
    New Upper Bounds for Maximum Satisfiability
    • 96
    • PDF
    An efficient fixed-parameter algorithm for 3-Hitting Set
    • 152
    Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs
    • 49
    • PDF
    On efficient fixed-parameter algorithms for weighted vertex cover
    • 35
    Simulated Annealing for SAT Problems Using Dynamic Markov Chains with Linear Regression Equilibrium
    • 1