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