Login / Signup
Polynomial-time Approximation Scheme for Minimum k-cut in Planar and Minor-free Graphs.
MohammadHossein Bateni
Alireza Farhadi
MohammadTaghi Hajiaghayi
Published in:
SODA (2019)
Keyphrases
</>
polynomial time approximation
planar graphs
approximation algorithms
error bounds
np hard
minimum cost
constant factor
identical machines
undirected graph
spanning tree
approximation guarantees
worst case
theoretical analysis
graph matching
minimum cut