On Efficient Fixed Parameter Algorithms for WEIGHTED VERTEX COVER
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
On efficient fixed-parameter algorithms for weighted vertex cover
Journal of Algorithms
An efficient fixed-parameter algorithm for 3-hitting set
Journal of Discrete Algorithms
Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Simpler and more general minimization for weighted finite-state automata
NAACL '03 Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology - Volume 1
An effective heuristic algorithm for the maximum satisfiability problem
Applied Intelligence
Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Solving SAT problems with TA algorithms using constant and dynamic markov chains length
AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
| Hi-index | 0.01 |
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.