A Polynomial Time Approximation Scheme for Metric MIN-BISECTION

Wenceslas Fernandez de la Vega, Marek Karpinski, Claire Kenyon. A Polynomial Time Approximation Scheme for Metric MIN-BISECTION. Electronic Colloquium on Computational Complexity (ECCC), (041), 2002. [doi]

@article{ECCC-TR02-041,
  title = {A Polynomial Time Approximation Scheme for Metric MIN-BISECTION},
  author = {Wenceslas Fernandez de la Vega and Marek Karpinski and Claire Kenyon},
  year = {2002},
  url = {http://eccc.hpi-web.de/eccc-reports/2002/TR02-041/index.html},
  researchr = {https://researchr.org/publication/ECCC-TR02-041},
  cites = {0},
  citedby = {0},
  journal = {Electronic Colloquium on Computational Complexity (ECCC)},
  number = {041},
}