Approximation algorithms for maximally balanced connected graph partition

DOI10.1007/978-3-030-36412-0_11zbMath1434.68353arXiv1910.02470OpenAlexW2994931140MaRDI QIDQ5918819

Zhi-Zhong Chen, Yao Xu, An Zhang, Guo-Hui Lin, Yong Chen

Publication date: 13 May 2020

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1910.02470

zbMATH Keywords

approximation algorithminduced subgraphconnected componentgraph partitionlocal improvement

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Approximation algorithms (68W25) Connectivity (05C40)

Related Items (4)

Balanced connected graph partition ⋮ Approximation algorithms for the maximum bounded connected bipartition problem ⋮ Approximation algorithms for the maximally balanced connected graph tripartition problem ⋮ Combinatorial approximation algorithms for the maximum bounded connected bipartition problem

This page was built for publication: Approximation algorithms for maximally balanced connected graph partition