Approximation and Inapproximability Results on Balanced Connected Partitions of Graphs
Let $G=(V,E)$ be a connected graph with a weight function $w: V o mathbb{Z_+}$, and let $q geq 2$ be a positive integer. For $Xsubseteq V$, let $w(X)$ denote the sum of the weights of the vertices in $X$. We consider the following problem on $G$: find a $q$-partition $P=(V_1,V_2, ldots, V_q)$ o...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Discrete Mathematics & Theoretical Computer Science
2007-01-01
|
| Series: | Discrete Mathematics & Theoretical Computer Science |
| Online Access: | http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/656 |
Search Result 1
Approximation and inapproximability results on balanced connected partitions of graphs
Published 2007-01-01
Get full text
Article