Approximation Algorithms for Maximally Balanced Connected Graph Partition.
Yong ChenZhi-Zhong ChenGuohui LinYao XuAn ZhangPublished in: COCOA (2019)
Keyphrases
- approximation algorithms
- undirected graph
- constant factor
- connected components
- np hard
- special case
- disjoint paths
- vertex cover
- vertex set
- minimum cost
- set cover
- open shop
- primal dual
- min cut
- network design problem
- worst case
- facility location problem
- np hardness
- directed graph
- connected graphs
- approximation ratio
- directed acyclic graph
- graph structure
- graph partitioning
- spanning tree
- planar graphs
- approximation schemes
- polynomial time approximation
- randomized algorithms
- combinatorial auctions
- constant factor approximation