Exact algorithms for NP-hard problems

@inproceedings{Woeginger2002ExactAF,
  title={Exact algorithms for NP-hard problems},
  author={Gerhard J. Woeginger},
  year={2002}
}
Highly Cited
This paper has 51 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.

52 Citations

01020'03'06'10'14'18
Citations per Year
Semantic Scholar estimates that this publication has 52 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 39 references

3-Coloring in time O(1.3446n): A no-MIS Algorithm

Electronic Colloquium on Computational Complexity • 1995

CA 95120 USA e-mail: dpw@almaden.ibm.com Previous winners of the Fulkerson Prize

E Dantsin, A Goerdt, +16 authors Kalai
Narendra Karmarkar • 1979

Approximation Algorithms for Combinatorial Optimization

X Jacod, Probability Protter, Essentials
Approximation Algorithms for Combinatorial Optimization

Automata, Languages and Programming. US $89.00 $66

Automata, Languages and Programming. US $89.00 $66

Combinatorial Pattern Matching. US $69.00 $51

Combinatorial Pattern Matching. US $69.00 $51

Concepts, Algorithms, and Applications. US $74.95 $56

X Fishman, Monte Carlo
Concepts, Algorithms, and Applications. US $74.95 $56

Graph Drawing. US $59.00 $44.25 ❏ 3-540-67296-6 Mei, Numerical Bifurcation Analysis for Reaction- Diffusion Equations

How to Solve It: Modern Heuristics. US $49.95 $37