A polynomial-time approximation scheme for planar multiway cut.

MohammadHossein Bateni MohammadTaghi Hajiaghayi Philip N. Klein Claire Mathieu

Published in: SODA (2012)

Keyphrases

polynomial time approximation
np hard
approximation algorithms
error bounds
identical machines
vertex cover
bin packing
planar graphs
worst case