Eran Halperin, Uri Zwick. A Unified Framework for Obtaining Improved Approximation Algorithms for Maximum Graph Bisection Problems. In Karen Aardal, Bert Gerards, editors, Integer Programming and Combinatorial Optimization, 8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings. Volume 2081 of Lecture Notes in Computer Science, pages 210-225, Springer, 2001. [doi]
@inproceedings{HalperinZ01,
title = {A Unified Framework for Obtaining Improved Approximation Algorithms for Maximum Graph Bisection Problems},
author = {Eran Halperin and Uri Zwick},
year = {2001},
url = {http://link.springer.de/link/service/series/0558/bibs/2081/20810210.htm},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/HalperinZ01},
cites = {0},
citedby = {0},
pages = {210-225},
booktitle = {Integer Programming and Combinatorial Optimization, 8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings},
editor = {Karen Aardal and Bert Gerards},
volume = {2081},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-42225-0},
}