Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

30

AUSSOIS
2001
Springer

favoriteEmaildiscussreport

269views Optimization» more AUSSOIS 2001»

Exact Algorithms for NP-Hard Problems: A Survey

13 years 9 months ago

Exact Algorithms for NP-Hard Problems: A Survey

Download faculty.cs.tamu.edu

We discuss fast exponential time solutions for NP-complete problems. We survey known results and approaches, we provide pointers to the literature, and we discuss several open problems in this area. The list of discussed NP-complete problems includes the travelling salesman problem, scheduling under precedence constraints, satisﬁability, knapsack, graph coloring, independent sets in graphs, bandwidth of a graph, and many more.

Gerhard J. Woeginger

Real-time Traffic

AUSSOIS 2001 | Fast Exponential Time | NP-complete Problems | Optimization | Travelling Salesman Problem |

claim paper

Related Content

» Fixing MaxProduct Convergent Message Passing Algorithms for MAP LPRelaxations

» Easy and hard coalition resource game formation problems a parameterized complexity analys...

» Sparse Subspace Clustering

» Iterative Compression for Exactly Solving NPHard Minimization Problems

» Optimal Partition of QoS Requirements for ManytoMany Connections

» An adaptive memory algorithm for the split delivery vehicle routing problem

» Twodimensional packing problems A survey

» Neighborhood based fast graph search in large networks

» Survey propagation an algorithm for satisfiability

Post Info
More Details (n/a)

Added	28 Jul 2010
Updated	28 Jul 2010
Type	Conference
Year	2001
Where	AUSSOIS
Authors	Gerhard J. Woeginger

Comments (0)