Approximation Algorithms for Maximally Balanced Connected Graph Partition

Given a connected graph G = ( V , E ) , we seek to partition the vertex set V into k non-empty parts such that the subgraph induced by each part is connected, and the partition is maximally balanced in the way that the maximum cardinality of these k parts is minimized. We refer this problem to as mi...

Full description

Saved in:

Bibliographic Details
Published in:	Algorithmica Vol. 83; no. 12; pp. 3715 - 3740
Main Authors:	Chen, Yong, Chen, Zhi-Zhong, Lin, Guohui, Xu, Yao, Zhang, An
Format:	Journal Article
Language:	English
Published:	New York Springer US 01-12-2021 Springer Nature B.V
Subjects:	Algorithm Analysis and Problem Complexity Algorithms Approximation Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Graph theory Mathematical analysis Mathematics of Computing Partitions (mathematics) Theory of Computation Vertex sets Graph partition Approximation algorithm Induced subgraph Connected component Local improvement
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!