IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v37y2019i2d10.1007_s10878-018-0268-8.html
   My bibliography  Save this article

Better approximability results for min–max tree/cycle/path cover problems

Author

Listed:
  • Wei Yu

    (East China University of Science and Technology)

  • Zhaohui Liu

    (East China University of Science and Technology)

Abstract

We study the problem of covering the vertices of an undirected weighted graph with a given number of trees (cycles, paths) to minimize the weight of the maximum weight tree (cycle, path). Improved inapproximability lower bounds are proved and better approximation algorithms are designed for several variants of this problem.

Suggested Citation

  • Wei Yu & Zhaohui Liu, 2019. "Better approximability results for min–max tree/cycle/path cover problems," Journal of Combinatorial Optimization, Springer, vol. 37(2), pages 563-578, February.
    • Handle: RePEc:spr:jcomop:v:37:y:2019:i:2:d:10.1007_s10878-018-0268-8
    DOI: 10.1007/s10878-018-0268-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-018-0268-8
    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-018-0268-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. Ann Melissa Campbell & Dieter Vandenbussche & William Hermann, 2008. "Routing for Relief Efforts," Transportation Science, INFORMS, vol. 42(2), pages 127-145, May.
    2. Zhou Xu & Liang Xu & Chung‐Lun Li, 2010. "Approximation results for min‐max path cover problems in vehicle routing," Naval Research Logistics (NRL), John Wiley & Sons, vol. 57(8), pages 728-748, December.
    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. Wei Yu & Zhaohui Liu & Xiaoguang Bao, 2021. "Approximation algorithms for some min–max postmen cover problems," Annals of Operations Research, Springer, vol. 300(1), pages 267-287, May.

    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, Xinwei & Wang, Tong & Thomas, Barrett W. & Ulmer, Marlin W., 2023. "Same-day delivery with fair customer service," European Journal of Operational Research, Elsevier, vol. 308(2), pages 738-751.
    2. Silva, Marcos Melo & Subramanian, Anand & Vidal, Thibaut & Ochi, Luiz Satoru, 2012. "A simple and effective metaheuristic for the Minimum Latency Problem," European Journal of Operational Research, Elsevier, vol. 221(3), pages 513-520.
    3. Eghbal Akhlaghi, Vahid & Campbell, Ann Melissa, 2022. "The two-echelon island fuel distribution problem," European Journal of Operational Research, Elsevier, vol. 302(3), pages 999-1017.
    4. Ferrer, José M. & Martín-Campo, F. Javier & Ortuño, M. Teresa & Pedraza-Martínez, Alfonso J. & Tirado, Gregorio & Vitoriano, Begoña, 2018. "Multi-criteria optimization for last mile distribution of disaster relief aid: Test cases and applications," European Journal of Operational Research, Elsevier, vol. 269(2), pages 501-515.
    5. Rivera, Juan Carlos & Murat Afsar, H. & Prins, Christian, 2016. "Mathematical formulations and exact algorithm for the multitrip cumulative capacitated single-vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 249(1), pages 93-104.
    6. Dukkanci, Okan & Karsu, Özlem & Kara, Bahar Y., 2022. "Planning sustainable routes: Economic, environmental and welfare concerns," European Journal of Operational Research, Elsevier, vol. 301(1), pages 110-123.
    7. Yang, Yongjian & Yin, Yunqiang & Wang, Dujuan & Ignatius, Joshua & Cheng, T.C.E. & Dhamotharan, Lalitha, 2023. "Distributionally robust multi-period location-allocation with multiple resources and capacity levels in humanitarian logistics," European Journal of Operational Research, Elsevier, vol. 305(3), pages 1042-1062.
    8. Suzuki, Yoshinori, 2020. "Impact of material convergence on last-mile distribution in humanitarian logistics," International Journal of Production Economics, Elsevier, vol. 223(C).
    9. Ohad Eisenhandler & Michal Tzur, 2019. "The Humanitarian Pickup and Distribution Problem," Operations Research, INFORMS, vol. 67(1), pages 10-32, January.
    10. Ali Ekici & Okan Örsan Özener, 2020. "Inventory routing for the last mile delivery of humanitarian relief supplies," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 42(3), pages 621-660, September.
    11. Li Zhu & Yeming Gong & Yishui Xu & Jun Gu, 2019. "Emergency relief routing models for injured victims considering equity and priority," Annals of Operations Research, Springer, vol. 283(1), pages 1573-1606, December.
    12. Yanyan Wang & Mingshu Lyu & Baiqing Sun, 2024. "Emergency resource allocation considering the heterogeneity of affected areas during the COVID-19 pandemic in China," Palgrave Communications, Palgrave Macmillan, vol. 11(1), pages 1-15, December.
    13. Maliheh Khorsi & Seyed Kamal Chaharsooghi & Ali Husseinzadeh Kashan & Ali Bozorgi-Amiri, 2021. "Pareto-based grouping meta-heuristic algorithm for humanitarian relief logistics with multistate network reliability," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 43(2), pages 327-365, June.
    14. Galindo, Gina & Batta, Rajan, 2013. "Review of recent developments in OR/MS research in disaster operations management," European Journal of Operational Research, Elsevier, vol. 230(2), pages 201-211.
    15. Duygu Pamukcu & Burcu Balcik, 2020. "A multi-cover routing problem for planning rapid needs assessment under different information-sharing settings," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 42(1), pages 1-42, March.
    16. Sahin, Halenur & Kara, Bahar Yetis & Karasan, Oya Ekin, 2016. "Debris removal during disaster response: A case for Turkey," Socio-Economic Planning Sciences, Elsevier, vol. 53(C), pages 49-59.
    17. Biplab Bhattacharya & Li Lin & Rajan Batta & Pavani K. Ram, 2020. "Stock-out severity index: tool for evaluating inequity in drug stock-outs," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 28(4), pages 1243-1263, December.
    18. Begoña Vitoriano & M. Ortuño & Gregorio Tirado & Javier Montero, 2011. "A multi-criteria optimization model for humanitarian aid distribution," Journal of Global Optimization, Springer, vol. 51(2), pages 189-208, October.
    19. Ahmadi, Morteza & Seifi, Abbas & Tootooni, Behnam, 2015. "A humanitarian logistics model for disaster relief operation considering network failure and standard relief time: A case study on San Francisco district," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 75(C), pages 145-163.
    20. Divya J. Nair & David Rey & Vinayak V. Dixit, 2017. "Fair allocation and cost-effective routing models for food rescue and redistribution," IISE Transactions, Taylor & Francis Journals, vol. 49(12), pages 1172-1188, December.

    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:37:y:2019:i:2:d:10.1007_s10878-018-0268-8. 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.