Piotr Berman, Marek Karpinski
Approximation Hardness of Bounded Degree MIN-CSP and MIN-BISECTION
ICALP, 2002.
@inproceedings{ICALP-2002-BermanK, author = "Piotr Berman and Marek Karpinski", booktitle = "{Proceedings of the 29th International Colloquium on Automata, Languages and Programming}", doi = "10.1007/3-540-45465-9_53", isbn = "3-540-43864-5", pages = "623--632", publisher = "{Springer International Publishing}", series = "{Lecture Notes in Computer Science}", title = "{Approximation Hardness of Bounded Degree MIN-CSP and MIN-BISECTION}", volume = 2380, year = 2002, }