How to find the best approximation results

@article{Crescenzi1998HowTF,
  title={How to find the best approximation results},
  author={Pierluigi Crescenzi and Viggo Kann},
  journal={SIGACT News},
  year={1998},
  volume={29},
  pages={90-97}
}
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. 
Who is interested in algorithms and why?: lessons from the Stony Brook algorithms repository
TLDR
This work analyzes WWW hits recorded on the Stony Brook Algorithms Repository to determine the relative level of interest among 75 algorithmic problems and the extent to which publicly available algorithm implementations satisfy this demand.
An effective heuristic algorithm for the maximum satisfiability problem
TLDR
A new SLS algorithm for MAXSAT is proposed based on an unconventional distribution known as the Bose-Einstein distribution in quantum physics that provides a stochastic initialization scheme to an efficient and very simple heuristic inspired by the co-evolution process of natural species and called Extremal Optimization (EO).
Solving the Maximum Satisfiability Problem Using an Evolutionary Local Search Algorithm
TLDR
Comparative tests showed that this extremal optimization procedure for MAXSAT improves significantly previous results obtained on the same benchmark with other modern local search methods like WSAT, simulated annealing and Tabu Search.
On Efficient Fixed Parameter Algorithms for WEIGHTED VERTEX COVER
TLDR
This work investigates the fixed parameter complexity of one of the most popular problems in combinatorial optimization, WEIGHTED VERTEX COVER, and shows that, when restricting the range of ω to positive integers, the so-called INTEGER-WVC can be solved as fast as unweighted VERT EX COVER.
New Upper Bounds for Maximum Satisfiability
The (unweighted) Maximum Satisfiability problem (MaxSat) is: Given a Boolean formula in conjunctive normal form, find a truth assignment that satisfies the largest number of clauses. This paper
Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs
TLDR
It is demonstrated that the tree decomposition-based approach provides a valuable way of exactly solving VERTEX COVER on planar graphs, and the impressive power of the so-called Nemhauser/Trotter theorem is demonstrated which provides a VERTex COVER-specific, extremely useful data reduction through polynomial time preprocessing.
On efficient fixed-parameter algorithms for weighted vertex cover
TLDR
The main result is that if the range of ω is restricted to positive reals ≥ 1, then so-called REAL-WVC can be solved in time O(1.3954k + k|V|).
Simulated Annealing for SAT Problems Using Dynamic Markov Chains with Linear Regression Equilibrium
TLDR
LRSA dynamically finds the equilibrium in the Metropolis cycle by using Linear Regression and shows that the proposed method is more efficient than the classical one, since it obtains the same quality in the final solution with less processing time.
Solving SAT Problems with TA Algorithms Using Constant and Dynamic Markov Chains Length
TLDR
This paper proposes a method based on the neighborhood structure to get the Markov chain length in a dynamic way for each temperature cycle and implemented two TA algorithms (classical or TACM and proposed or TADM) for SAT.
Simpler and More General Minimization for Weighted Finite-State Automata
TLDR
This work presents efficient new minimization algorithms that apply much more generally, while being simpler and about as fast, and characterize the kind of "well-behaved" weight semirings where these methods work.
...
1
2
...

References

SHOWING 1-10 OF 17 REFERENCES
Approximation Algorithms for NP-Hard Problems
TLDR
This book introduces unifying techniques in the analysis of approximation algorithms, intended for computer scientists and operations researchers interested in specific algorithm implementations, as well as design tools for algorithms.
Approximation Algorithms for Combinatorial Problems
TLDR
For the problem of finding the maximum clique in a graph, no algorithm has been found for which the ratio does not grow at least as fast as n^@e, where n is the problem size and @e>0 depends on the algorithm.
Structure in Approximation Classes
TLDR
After defining a new approximation preserving reducibility to be used for as many approximation classes as possible, this paper gives the first examples of natural NPO-complete problems and the firstExamples of natural APX-intermediate problems.
On Dependent Randomized Rounding Algorithms
TLDR
A class of rounding methods is described that exploits the structure and geometry of the underlying problem to round fractional solution to 0–1 solution and can be used to establish the integrality of several classical polyhedra.
Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT
  • U. Feige, M. Goemans
  • Mathematics, Computer Science
    Proceedings Third Israel Symposium on the Theory of Computing and Systems
  • 1995
TLDR
The approach combines the Feige-Lovasz (STOC92) semidefinite programming relaxation of one-round two-prover proof systems, together with rounding techniques for the solutions of semideFinite programs, as introduced by Goemans and Williamson (SToc94).
Computers and Intractability: A Guide to the Theory of NP-Completeness
Horn formulae play a prominent role in artificial intelligence and logic programming. In this paper we investigate the problem of optimal compression of propositional Horn production rule knowledge
Annotated Bibliographies in Combinatorial Optimization
Part I: General methodologies complexity and approximability polyhedral combinatorics branch-and-cut algorithms matroids and submodular functions advances in linear programming decomposition and
The NP-Completeness of Edge-Coloring
  • I. Holyer
  • Mathematics, Computer Science
    SIAM J. Comput.
  • 1981
TLDR
It is shown that it is NP-complete to determine the chromatic index of an arbitrary graph, even for cubic graphs.
A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP
TLDR
A new low-degree-test is introduced, one that uses the restriction of low- degree polynomials to planes rather than the restriction to lines, and enables us to prove a low-error characterization of NP in terms of PCP.
On the 1.1 Edge-Coloring of Multigraphs
TLDR
The proof yields an algorithm which edge-colors any given multigraph G with at most $\lfloor 1.1q^* ( G ) + 0.8 \rfloor $ colors.
...
1
2
...