Approximation algorithms for the maximally balanced connected graph tripartition problem.
Guangting ChenYong ChenZhi-Zhong ChenGuohui LinTian LiuAn ZhangPublished in: J. Comb. Optim. (2022)
Keyphrases
- approximation algorithms
- undirected graph
- np hard
- constant factor
- connected components
- worst case
- minimum cost
- special case
- disjoint paths
- vertex cover
- facility location problem
- spanning tree
- random walk
- weighted graph
- directed graph
- primal dual
- network design problem
- approximation ratio
- approximation schemes
- graph structure
- open shop
- precedence constraints
- set cover
- directed acyclic graph
- bipartite graph
- combinatorial auctions
- connected graphs
- planar graphs
- lower bound
- constant factor approximation