Polynomial Time Approximability of Dense Weighted Instances of Max-cut

  • M. Karpinskiy
  • Published 1997

Abstract

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

Topics

Cite this paper

@inproceedings{Karpinskiy1997PolynomialTA, title={Polynomial Time Approximability of Dense Weighted Instances of Max-cut}, author={M. Karpinskiy}, year={1997} }