Polynomial Time Approximation of Dense Weighted Instances of MAX-CUT

Wenceslas Fernandez de la Vega, Marek Karpinski. Polynomial Time Approximation of Dense Weighted Instances of MAX-CUT. Electronic Colloquium on Computational Complexity (ECCC), 5(64), 1998. [doi]

@article{ECCC-TR98-064,
  title = {Polynomial Time Approximation of Dense Weighted Instances of MAX-CUT},
  author = {Wenceslas Fernandez de la Vega and Marek Karpinski},
  year = {1998},
  url = {http://eccc.hpi-web.de/eccc-reports/1998/TR98-064/index.html},
  researchr = {https://researchr.org/publication/ECCC-TR98-064},
  cites = {0},
  citedby = {0},
  journal = {Electronic Colloquium on Computational Complexity (ECCC)},
  volume = {5},
  number = {64},
}