Sciweavers

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

108

Voted

CORR
2004
Springer

104views Education» more CORR 2004»

Inapproximability of Combinatorial Optimization Problems

15 years 2 months ago

Inapproximability of Combinatorial Optimization Problems

Download www.cs.berkeley.edu

We survey results on the hardness of approximating combinatorial optimization problems. Contents

Luca Trevisan

Real-time Traffic

Combinatorial Optimization Problems | CORR 2004 | Education | Hardness |

claim paper

Related Content

» From query complexity to computational complexity

» CABOB A Fast Optimal Algorithm for Combinatorial Auctions

» Differentially Private Combinatorial Optimization

» Inapproximability Results for Combinatorial Auctions with Submodular Utility Functions

» Solving combinatorial exchanges optimality via a few partial bids

» Algorithm for optimal winner determination in combinatorial auctions

» The complexity of maximum matroidgreedoid intersection and weighted greedoid maximization

» Gadgets Approximation and Linear Programming

» Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems

Post Info
More Details (n/a)

Added	17 Dec 2010
Updated	17 Dec 2010
Type	Journal
Year	2004
Where	CORR
Authors	Luca Trevisan

Comments (0)