Polynomial-time Approximation Scheme for Minimum k-cut in Planar and Minor-free Graphs.
MohammadHossein BateniAlireza FarhadiMohammadTaghi HajiaghayiPublished in: CoRR (2018)
Keyphrases
- polynomial time approximation
- np hard
- approximation algorithms
- planar graphs
- error bounds
- approximation guarantees
- minimum cost
- constant factor
- greedy algorithm
- minimum cut
- graph matching
- weighted graph
- spanning tree
- graph theory
- bin packing
- search algorithm
- worst case
- approximation ratio
- undirected graph
- integer programming
- shortest path
- np complete