Publication Date:
2021-01-22
Description:
We consider the problem of partitioning a weighted graph into k
connected components of similar weight. In particular, we consider the two classical objectives to maximize the lightest part or to minimize the heaviest part. For a partitioning of the vertex set and for both objectives, we give the first known approximation results on general graphs. Specifically, we give a $\Delta$-approximation where $\Delta$ is the maximum degree of an arbitrary spanning tree of the given graph.
Concerning the edge partition case, we even obtain a 2-approximation for the min-max and the max-min problem, by using the claw-freeness of line graphs.
Language:
English
Type:
reportzib
,
doc-type:preprint
Format:
application/pdf
Permalink