Department of Computer Science
 
Chair V

 
University of Bonn -> Department of Computer Science -> Chair V
CS-APX-Reports 1997 Copyright 1997 University of Bonn, Department of Computer Science, Abt. V
8938

Polynomial Time Approximability of Dense Weighted Instances of MAX-CUT
W. Fernandez de la Vega, Marek Karpinski
[Download PostScript] [Download PDF]

We give the first polynomial time approximability characterization of dense weighted instances of MAX-CUT, and some other dense weighted ${\cal NP}$-hard problems in terms of their empirical weight distributions.

Last Change: 11/05/14 at 10:06:14
 Deutsch
University of Bonn -> Department of Computer Science -> Chair V