Approximation Algorithms for MAX-BISECTION on Low Degree Regular Graphs

Marek Karpinski, Miroslaw Kowaluk, Andrzej Lingas. Approximation Algorithms for MAX-BISECTION on Low Degree Regular Graphs. Fundamenta Informaticae, 62(3-4):369-375, 2004. [doi]

@article{KarpinskiKL04,
  title = {Approximation Algorithms for MAX-BISECTION on Low Degree Regular Graphs},
  author = {Marek Karpinski and Miroslaw Kowaluk and Andrzej Lingas},
  year = {2004},
  url = {http://iospress.metapress.com/openurl.asp?genre=article&issn=0169-2968&volume=62&issue=3&spage=369},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/KarpinskiKL04},
  cites = {0},
  citedby = {0},
  journal = {Fundamenta Informaticae},
  volume = {62},
  number = {3-4},
  pages = {369-375},
}