Approximating the maximally balanced con
✍
Janka Chlebíková
📂
Article
📅
1996
🏛
Elsevier Science
🌐
English
⚖ 572 KB
The approximability of the following optimization problem is investigated: Given a connected graph G = (YE), find the maximally balanced connected partition for G, i.e. a partition (K, V2) of V into disjoint sets VI and V2 such that both subgraphs of G induced by VI and & are connected, and maximize