Journal of Global Optimization

, Volume 57, Issue 4, pp 1263–1275 | Cite as

Max-min weight balanced connected partition

  • Lele Wang
  • Zhao ZhangEmail author
  • Di Wu
  • Weili Wu
  • Lidan Fan


For a connected graph \(G=(V,E)\) and a positive integral vertex weight function \(w\), a max-min weight balanced connected \(k\)-partition of \(G\), denoted as \(BCP_k\), is a partition of \(V\) into \(k\) disjoint vertex subsets \((V_1,V_2,\ldots ,V_k)\) such that each \(G[V_i]\) (the subgraph of \(G\) induced by \(V_i\)) is connected, and \(\min _{1\le i\le k}\{w(V_i)\}\) is maximum. Such a problem has a lot of applications in image processing and clustering, and was proved to be NP-hard. In this paper, we study \(BCP_k\) on a special class of graphs: trapezoid graphs whose maximum degree is bounded by a constant. A pseudo-polynomial time algorithm is given, based on which an FPTAS is obtained for \(k=2,3,4\). A step-stone for the analysis of the FPTAS depends on a lower bound for the optimal value of \(BCP_k\) in terms of the total weight of the graph. In providing such a lower bound, a byproduct of this paper is that any 4-connected trapezoid graph on at least seven vertices has a 4-contractible edge, which may have a value in its own right.


Balanced connected partition Pseudo-polynomial time algorithm FPTAS 


  1. 1.
    Alimonti, P., Calamoneri, T.: On the complexity of the max balance problem. In: Argentinian Workshop on, Theoretical Computer Science (WAIT’99) (1999) 133–138Google Scholar
  2. 2.
    Becker, R., Lari, I., Lucertini, M., Simeone, B.: Max-min partitioning of grid graphs into connected components. Networks 32, 115–125 (1998)CrossRefGoogle Scholar
  3. 3.
    Becker, R., Lari, I., Lucertini, M., Simeone, B.: A polynomial-time algorithm for max-min partitioning of ladders. Theory Comput. Syst. 34, 353–374 (2001)CrossRefGoogle Scholar
  4. 4.
    Bera, D., Pal, M., Pal, T.K.: An efficient algorithm to generate all maximal cliques on trapezoid graphs. Int. J. Comput. Math. 79, 1057–1065 (2002)CrossRefGoogle Scholar
  5. 5.
    Bondy, J.A., Murty, U.S.R.: Graph Theory, p. 222. Springer, New York (2008)CrossRefGoogle Scholar
  6. 6.
    Chataigner, F., Salgado, L.R.B., Wakabayashi, Y.: Approximation and inaproximability results on balanced connected partitions of graphs. Discret. Math. Theor. Comput. Sci. 9, 177–192 (2007)Google Scholar
  7. 7.
    Cheah, F., Corneil, D.G.: On the structure of trapezoid graphs. Discret. Appl. Math. 66, 109–133 (1996)CrossRefGoogle Scholar
  8. 8.
    Chlebíková, J.: Approximating the maximally balanced connected partition problem in graphs. Inf. Process. Lett. 60, 225–230 (1996)CrossRefGoogle Scholar
  9. 9.
    Dagan, I., Golumbic, M.C., Pinter, R.Y.: Trapezoid graphs and their coloring. Discret. Appl. Math. 21, 35–46 (1988)Google Scholar
  10. 10.
    Dyer, M., Frieze, A.: On the complexity of partitioning graphs into connected subgraphs. Discret. Appl. Math. 10, 139–153 (1985)CrossRefGoogle Scholar
  11. 11.
    Fontet, M.: Graphes 4-essential. C. R. Acad. Sci. Paris 287, 289–290 (1978)Google Scholar
  12. 12.
    Galbiati, G., Mattioli, F., Morzenti, A.: On the approximability of some maximum spanning tree problems. Theor. Comput. Sci. 181, 107–118 (1997)CrossRefGoogle Scholar
  13. 13.
    Ghosh, P.K., Pal, M.: An effcient algorithm to solve connectivity problem on trapezoid graphs. J. Appl. Math. Comput. 24, 141–154 (2007)CrossRefGoogle Scholar
  14. 14.
    Györi, E.: On division of graph to connected subgraphs. In: Combinatoris (Proc. Fifth Hungarian Colloq., Koszthely, 1976), vol. I, Volume 18 of Colloq. Math. Soc. János Bolyai, North-Holland, Amsterdam, 485–494 (1978)Google Scholar
  15. 15.
    Lovász, L.: A homology theory for spanning trees of a graph. Acta Math. Acad. Sci. Hung. 30, 241–251 (1977)CrossRefGoogle Scholar
  16. 16.
    Lucertini, M., Perl, Y., Simeone, B.: Most uniform path partitioning and its use in image processing. Discret. Appl. Math. 42, 227–256 (1993)CrossRefGoogle Scholar
  17. 17.
    Ma, J., Ma, S.H.: An \(O(k^2n^2)\) algorithm to find a \(k\)-partition in a \(k\)-connected graph. J. Comput. Sci. Technol. 9, 86–91 (1994)CrossRefGoogle Scholar
  18. 18.
    Maravalle, M., Simeone, B., Naldini, R.: Clustering on trees. Comput. Stat. Data Anal. 24, 217–234 (1997)CrossRefGoogle Scholar
  19. 19.
    Martinov, N.: Uncontractible 4-connected graphs. J. Graph Theory 6, 343–344 (1982)CrossRefGoogle Scholar
  20. 20.
    Nakano, S., Rahman, M., Nishizeki, T.: A linear-time algorithm for four-partitioning four-connected planar graphs. Inf. Process. Lett. 62, 315–322 (1997)CrossRefGoogle Scholar
  21. 21.
    Perl, Y., Schach, S.: Max-min tree partitioning. J. ACM 28, 5–15 (1981)CrossRefGoogle Scholar
  22. 22.
    Suzuki, H., Takahashi, N., Nishizeki, T.: A linear algorithm for \(2\)-partition of bi-connected graphs. Inf. Process. Lett. 33, 227–232 (1990)CrossRefGoogle Scholar
  23. 23.
    Suzuki, H., Takahashi, N., Nishizeki, T., Miyano, H., Ueno, S.: An algorithm for tri-partitioning 3-connected graphs. J. Inf. Process. Soc. Jpn. (1990)Google Scholar
  24. 24.
    Thomassen, C.: Non-separating cycles in \(k\)-connected graphs. J. Graph Theory 5, 351–354 (1981)CrossRefGoogle Scholar
  25. 25.
    Wu, B.Y.: Fully polynomial time approximation schemes for the max-min connected partition problem on interval graphs. Discret. Math. Algorithm. Appl. 04, 1250005 (2012)CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2012

Authors and Affiliations

  • Lele Wang
    • 1
  • Zhao Zhang
    • 1
    Email author
  • Di Wu
    • 1
  • Weili Wu
    • 2
  • Lidan Fan
    • 2
  1. 1.College of Mathematics and System SciencesXinjiang UniversityUrumqiPeople’s Republic of China
  2. 2.Department of Computer ScienceUniversity of Texas at DallasRichardsonUSA

Personalised recommendations