IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v57y2013i4p1263-1275.html
   My bibliography  Save this article

Max-min weight balanced connected partition

Author

Listed:
  • Lele Wang
  • Zhao Zhang
  • Di Wu
  • Weili Wu
  • Lidan Fan

Abstract

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. Copyright Springer Science+Business Media New York 2013

Suggested Citation

  • Lele Wang & Zhao Zhang & Di Wu & Weili Wu & Lidan Fan, 2013. "Max-min weight balanced connected partition," Journal of Global Optimization, Springer, vol. 57(4), pages 1263-1275, December.
    • Handle: RePEc:spr:jglopt:v:57:y:2013:i:4:p:1263-1275
    DOI: 10.1007/s10898-012-0028-8
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10898-012-0028-8
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10898-012-0028-8?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Maravalle, Maurizio & Simeone, Bruno & Naldini, Rosella, 1997. "Clustering on trees," Computational Statistics & Data Analysis, Elsevier, vol. 24(2), pages 217-234, April.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Guangting Chen & Yong Chen & Zhi-Zhong Chen & Guohui Lin & Tian Liu & An Zhang, 2022. "Approximation algorithms for the maximally balanced connected graph tripartition problem," Journal of Combinatorial Optimization, Springer, vol. 44(3), pages 1753-1773, October.
    2. Guangting Chen & Yong Chen & Zhi-Zhong Chen & Guohui Lin & Tian Liu & An Zhang, 0. "Approximation algorithms for the maximally balanced connected graph tripartition problem," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-21.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Alexandre Xavier Ywata Carvalho & Pedro Henrique Melo Albuquerque & Gilberto Rezende de Almeida Junior & Rafael Dantas Guimarães & Camilo Rey Laureto, 2009. "Clusterização Hierárquica Espacial com Atributos Binários," Discussion Papers 1428, Instituto de Pesquisa Econômica Aplicada - IPEA.
    2. Alexandre Xavier Ywata Carvalho & Pedro Henrique Melo Albuquerque & Gilberto Rezende de Almeida Junior & Rafael Dantas Guimarães, 2009. "Clusterização Hierárquica Espacial," Discussion Papers 1427, Instituto de Pesquisa Econômica Aplicada - IPEA.
    3. Liverani, Marco & Morgana, Aurora & Simeone, Bruno & Storchi, Giovanni, 2000. "Path equipartition in the Chebyshev norm," European Journal of Operational Research, Elsevier, vol. 123(2), pages 428-435, June.
    4. Zhou, Ruoyu & Shu, Lianjie & Su, Yan, 2015. "An adaptive minimum spanning tree test for detecting irregularly-shaped spatial clusters," Computational Statistics & Data Analysis, Elsevier, vol. 89(C), pages 134-146.
    5. Miyazawa, Flávio K. & Moura, Phablo F.S. & Ota, Matheus J. & Wakabayashi, Yoshiko, 2021. "Partitioning a graph into balanced connected classes: Formulations, separation and experiments," European Journal of Operational Research, Elsevier, vol. 293(3), pages 826-836.
    6. G. Damiana Costanzo, 2001. "A constrainedk-means clustering algorithm for classifying spatial units," Statistical Methods & Applications, Springer;Società Italiana di Statistica, vol. 10(1), pages 237-256, January.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jglopt:v:57:y:2013:i:4:p:1263-1275. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.