IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v45y2023i1d10.1007_s10878-022-00981-9.html
   My bibliography  Save this article

Combinatorial approximation algorithms for the maximum bounded connected bipartition problem

Author

Listed:
  • Xiaofei Liu

    (Yunnan University)

  • Yajie Li

    (Yunnan University)

  • Weidong Li

    (Yunnan University
    Yunnan Center of Applied Mathematics)

  • Jinhua Yang

    (Dianchi College)

Abstract

In this paper, we study the maximum bounded connected bipartition problem: given a vertex-weighted connected graph $$G=(V,E;w)$$ G = ( V , E ; w ) and an upper bound B, the vertex set V is partitioned into two subsets $$(V_1,V_2)$$ ( V 1 , V 2 ) such that the total weight of the two subgraphs induced by $$V_1$$ V 1 and $$V_2$$ V 2 is maximized, and these subgraphs are connected, where the weight of a subgraph is the minimum of B and the total weight of all vertices in the subgraph. In this paper, we prove that this problem is NP-hard even when G is a completed graph, a grid graph with only 3 rows or an interval graph, and we present an $$\frac{8}{7}$$ 8 7 -approximation algorithm. In particular, we present a $$\frac{14}{13}$$ 14 13 -approximation algorithm for the case of grid graphs, and we present a fully polynomial-time approximation scheme for the case of interval graphs.

Suggested Citation

  • Xiaofei Liu & Yajie Li & Weidong Li & Jinhua Yang, 2023. "Combinatorial approximation algorithms for the maximum bounded connected bipartition problem," Journal of Combinatorial Optimization, Springer, vol. 45(1), pages 1-21, January.
    • Handle: RePEc:spr:jcomop:v:45:y:2023:i:1:d:10.1007_s10878-022-00981-9
    DOI: 10.1007/s10878-022-00981-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-022-00981-9
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-022-00981-9?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. Chen, Xin & Liang, Yage & Sterna, Małgorzata & Wang, Wen & Błażewicz, Jacek, 2020. "Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date," European Journal of Operational Research, Elsevier, vol. 284(1), pages 67-74.
    2. Malgorzata Sterna & Kateryna Czerniachowska, 2017. "Polynomial Time Approximation Scheme for Two Parallel Machines Scheduling with a Common Due Date to Maximize Early Work," Journal of Optimization Theory and Applications, Springer, vol. 174(3), pages 927-944, September.
    3. Sterna, Małgorzata, 2021. "Late and early work scheduling: A survey," Omega, Elsevier, vol. 104(C).
    4. Byung-Cheon Choi & Myoung-Ju Park & Kyung Min Kim & Yunhong Min, 2021. "A Parallel Machine Scheduling Problem Maximizing Total Weighted Early Work," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 38(06), pages 1-16, December.
    5. Yamada, Takeo & Takahashi, Hideo & Kataoka, Seiji, 1996. "A heuristic algorithm for the mini-max spanning forest problem," European Journal of Operational Research, Elsevier, vol. 91(3), pages 565-572, June.
    6. Györgyi, Péter & Kis, Tamás, 2020. "A common approximation framework for early work, late work, and resource leveling problems," European Journal of Operational Research, Elsevier, vol. 286(1), pages 129-137.
    Full references (including those not matched with items on IDEAS)

    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. Chen, Xin & Miao, Qian & Lin, Bertrand M.T. & Sterna, Malgorzata & Blazewicz, Jacek, 2022. "Two-machine flow shop scheduling with a common due date to maximize total early work," European Journal of Operational Research, Elsevier, vol. 300(2), pages 504-511.
    2. Sterna, Małgorzata, 2021. "Late and early work scheduling: A survey," Omega, Elsevier, vol. 104(C).
    3. Jiang, Yiwei & Wu, Mengjing & Chen, Xin & Dong, Jianming & Cheng, T.C.E. & Blazewicz, Jacek & Ji, Min, 2024. "Online early work scheduling on parallel machines," European Journal of Operational Research, Elsevier, vol. 315(3), pages 855-862.
    4. Yunhong Min & Byung-Cheon Choi & Myoung-Ju Park & Kyung Min Kim, 2023. "A parallel-machine scheduling problem with an antithetical property to maximize total weighted early work," 4OR, Springer, vol. 21(3), pages 421-437, September.
    5. Shabtay, Dvir & Mosheiov, Gur & Oron, Daniel, 2022. "Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work," European Journal of Operational Research, Elsevier, vol. 303(1), pages 66-77.
    6. Györgyi, Péter & Kis, Tamás, 2020. "A common approximation framework for early work, late work, and resource leveling problems," European Journal of Operational Research, Elsevier, vol. 286(1), pages 129-137.
    7. Meloni, Carlo & Pranzo, Marco & Samà, Marcella, 2022. "Evaluation of VaR and CVaR for the makespan in interval valued blocking job shops," International Journal of Production Economics, Elsevier, vol. 247(C).
    8. Federica Ricca & Andrea Scozzari & Bruno Simeone, 2013. "Political Districting: from classical models to recent approaches," Annals of Operations Research, Springer, vol. 204(1), pages 271-299, April.
    9. Shi-Sheng Li & Jin-Jiang Yuan, 2020. "Single-machine scheduling with multi-agents to minimize total weighted late work," Journal of Scheduling, Springer, vol. 23(4), pages 497-512, August.
    10. Dvir Shabtay, 2023. "A new perspective on single-machine scheduling problems with late work related criteria," Annals of Operations Research, Springer, vol. 322(2), pages 947-966, March.
    11. Kataoka, Seiji & Araki, Norio & Yamada, Takeo, 2000. "Upper and lower bounding procedures for minimum rooted k-subtree problem," European Journal of Operational Research, Elsevier, vol. 122(3), pages 561-569, May.
    12. Mekking, M. & Volgenant, A., 2010. "Solving the 2-rooted mini-max spanning forest problem by branch-and-bound," European Journal of Operational Research, Elsevier, vol. 203(1), pages 50-58, May.
    13. Chen, Rubing & Geng, Zhichao & Lu, Lingfa & Yuan, Jinjiang & Zhang, Yuan, 2022. "Pareto-scheduling of two competing agents with their own equal processing times," European Journal of Operational Research, Elsevier, vol. 301(2), pages 414-431.
    14. da Cunha, Alexandre Salles & Simonetti, Luidi & Lucena, Abilio, 2015. "Optimality cuts and a branch-and-cut algorithm for the K-rooted mini-max spanning forest problem," European Journal of Operational Research, Elsevier, vol. 246(2), pages 392-399.
    15. Chen, Xin & Liang, Yage & Sterna, Małgorzata & Wang, Wen & Błażewicz, Jacek, 2020. "Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date," European Journal of Operational Research, Elsevier, vol. 284(1), pages 67-74.
    16. Kasper, T.A. Arno & Land, Martin J. & Teunter, Ruud H., 2023. "Towards System State Dispatching in High‐Variety Manufacturing," Omega, Elsevier, vol. 114(C).
    17. Yi-Chun Wang & Ji-Bo Wang, 2023. "Study on Convex Resource Allocation Scheduling with a Time-Dependent Learning Effect," Mathematics, MDPI, vol. 11(14), pages 1-20, July.
    18. Shi-Sheng Li & Ren-Xia Chen, 2022. "Minimizing total weighted late work on a single-machine with non-availability intervals," Journal of Combinatorial Optimization, Springer, vol. 44(2), pages 1330-1355, September.

    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:jcomop:v:45:y:2023:i:1:d:10.1007_s10878-022-00981-9. 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.