Approximation algorithms for maximally balanced connected graph partition.
Yong ChenZhi-Zhong ChenGuohui LinYao XuAn ZhangPublished in: CoRR (2019)
Keyphrases
- approximation algorithms
- undirected graph
- constant factor
- np hard
- connected components
- special case
- disjoint paths
- minimum cost
- worst case
- vertex cover
- vertex set
- random walk
- set cover
- spanning tree
- facility location problem
- approximation ratio
- open shop
- randomized algorithms
- approximation schemes
- network design problem
- primal dual
- graph structure
- min cut
- directed graph
- planar graphs
- polynomial time approximation
- graph partitioning
- connected graphs
- lower bound
- approximation guarantees
- weighted graph
- bipartite graph