Rheinische Friedrich-Wilhelms-Universität Bonn Institut für Informatik
 
Abteilung V

 
Universität Bonn -> Institut für Informatik -> Abteilung V
CS-APX-Reports 2000 Copyright 2000 Universität Bonn, Institut für Informatik, Abt. V
8958

Polynomial Time Approximation of Dense Weighted Instances of MAX-CUT (Revised Version)
W. Fernanadez de la Vega and Marek Karpinski
[Download PostScript] [Download PDF]

We give the first polynomial time approximability characterizations of dense weighted instances of MAX-CUT, and some other dense weighted NP-hard problems in terms of their empirical weight distributions. This gives also the first almost sharp characterization of inapproximability of unweighted 0,1 MAX-BISECTION instances in terms of their density parameter.

Last Change: 11/05/14 at 10:18:19
 English
Universität Bonn -> Institut für Informatik -> Abteilung V

Powered by Zope