IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v49y2025i3d10.1007_s10878-025-01278-3.html
   My bibliography  Save this article

Approximation algorithms for solving the heterogeneous rooted tree/path cover problems

Author

Listed:
  • Pengxiang Pan

    (Yunnan University)

  • Junran Lichen

    (Beijing University of Chemical Technology)

  • Ping Yang

    (Yunnan University)

  • Jianping Li

    (Yunnan University)

Abstract

In this paper, we consider the heterogeneous rooted tree cover (HRTC) problem, which further generalizes the rooted tree cover problem. Specifically, given a complete graph $$G=(V,E; w,f; r)$$ G = ( V , E ; w , f ; r ) and k construction teams, having nonuniform construction speeds $$\lambda _{1}$$ λ 1 , $$\lambda _{2}$$ λ 2 , $$\ldots $$ … , $$\lambda _{k}$$ λ k , where $$r\in V$$ r ∈ V is a fixed common root, $$w:E\rightarrow {\mathbb {R}}^{+}$$ w : E → R + is an edge-weight function, satisfying the triangle inequality, and $$f:V\rightarrow {\mathbb {R}}^{+}_{0}$$ f : V → R 0 + (i.e., $${\mathbb {R}}^{+}\cup \{0\})$$ R + ∪ { 0 } ) is a vertex-weight function with $$f(r)=0$$ f ( r ) = 0 , we are asked to find k trees for these k construction teams, each tree having the same root r, and collectively covering all vertices in V, the objective is to minimize the maximum completion time of k construction teams, where the completion time of each team is the total construction weight of its related tree divided by its construction speed. In addition, substituting k paths for k trees in the HRTC problem, we also consider the heterogeneous rooted path cover (HRPC) problem. Our main contributions are as follows. (1) Given any small constant $$\delta >0$$ δ > 0 , we first design a $$58.3286(1+\delta )$$ 58.3286 ( 1 + δ ) -approximation algorithm to solve the HRTC problem, and this algorithm runs in time $$O(n^{2}(n+\frac{\log n}{\delta })+\log (w(E)+f(V)))$$ O ( n 2 ( n + log n δ ) + log ( w ( E ) + f ( V ) ) ) . Meanwhile, we present a simple $$116.6572(1+\delta )$$ 116.6572 ( 1 + δ ) -approximation algorithm to solve the HRPC problem, whose time complexity is the same as the preceding algorithm. (2) We provide a $$\max \{2\rho , 2+\rho -\frac{2}{k}\}$$ max { 2 ρ , 2 + ρ - 2 k } -approximation algorithm to resolve the HRTC problem, and that algorithm runs in time $$O(n^{2})$$ O ( n 2 ) , where $$\rho $$ ρ is the ratio of the largest team speed to the smallest one. At the same time, we can prove that the preceding $$\max \{2\rho , 2+\rho -\frac{2}{k}\}$$ max { 2 ρ , 2 + ρ - 2 k } -approximation algorithm also resolves the HRPC problem.

Suggested Citation

  • Pengxiang Pan & Junran Lichen & Ping Yang & Jianping Li, 2025. "Approximation algorithms for solving the heterogeneous rooted tree/path cover problems," Journal of Combinatorial Optimization, Springer, vol. 49(3), pages 1-19, April.
  • Handle: RePEc:spr:jcomop:v:49:y:2025:i:3:d:10.1007_s10878-025-01278-3
    DOI: 10.1007/s10878-025-01278-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-025-01278-3
    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-025-01278-3?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. 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.
    2. Weili Wu & Zhao Zhang & Wonjun Lee & Ding-Zhu Du, 2020. "Optimal Coverage in Wireless Sensor Networks," Springer Optimization and Its Applications, Springer, number 978-3-030-52824-9, December.
    3. Ann Melissa Campbell & Dieter Vandenbussche & William Hermann, 2008. "Routing for Relief Efforts," Transportation Science, INFORMS, vol. 42(2), pages 127-145, May.
    4. Inge Li Gørtz & Marco Molinaro & Viswanath Nagarajan & R. Ravi, 2016. "Capacitated Vehicle Routing with Nonuniform Speeds," Mathematics of Operations Research, INFORMS, vol. 41(1), pages 318-331, February.
    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. A. Anaya-Arenas & J. Renaud & A. Ruiz, 2014. "Relief distribution networks: a systematic review," Annals of Operations Research, Springer, vol. 223(1), pages 53-79, December.
    2. Karsu, Özlem & Morton, Alec, 2015. "Inequity averse optimization in operational research," European Journal of Operational Research, Elsevier, vol. 245(2), pages 343-359.
    3. Yingli Ran & Xiaohui Huang & Zhao Zhang & Ding-Zhu Du, 2021. "Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks," Journal of Global Optimization, Springer, vol. 80(3), pages 661-677, July.
    4. Changshi Liu & Gang Kou & Yi Peng & Fawaz E. Alsaadi, 2019. "Location-Routing Problem for Relief Distribution in the Early Post-Earthquake Stage from the Perspective of Fairness," Sustainability, MDPI, vol. 11(12), pages 1-16, June.
    5. 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.
    6. 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.
    7. Yuhe Shi & Zhenggang He, 2018. "Decision Analysis of Disturbance Management in the Process of Medical Supplies Transportation after Natural Disasters," IJERPH, MDPI, vol. 15(8), pages 1-18, August.
    8. 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.
    9. Li Zhu & Yeming Gong & Yishui Xu & Jun Gu, 2019. "Emergency Relief Routing Models for Injured Victims Considering Equity and Priority," Post-Print hal-02879681, HAL.
    10. Kyriakakis, Nikolaos A. & Marinaki, Magdalene & Matsatsinis, Nikolaos & Marinakis, Yannis, 2022. "A cumulative unmanned aerial vehicle routing problem approach for humanitarian coverage path planning," European Journal of Operational Research, Elsevier, vol. 300(3), pages 992-1004.
    11. 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.
    12. de la Torre, Luis E. & Dolinskaya, Irina S. & Smilowitz, Karen R., 2012. "Disaster relief routing: Integrating research and practice," Socio-Economic Planning Sciences, Elsevier, vol. 46(1), pages 88-97.
    13. 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.
    14. Amir Masoud Rahmani & Saqib Ali & Mohammad Sadegh Yousefpoor & Efat Yousefpoor & Rizwan Ali Naqvi & Kamran Siddique & Mehdi Hosseinzadeh, 2021. "An Area Coverage Scheme Based on Fuzzy Logic and Shuffled Frog-Leaping Algorithm (SFLA) in Heterogeneous Wireless Sensor Networks," Mathematics, MDPI, vol. 9(18), pages 1-41, September.
    15. Robert W. Lien & Seyed M. R. Iravani & Karen R. Smilowitz, 2014. "Sequential Resource Allocation for Nonprofit Operations," Operations Research, INFORMS, vol. 62(2), pages 301-317, April.
    16. Jianping Li & Ping Yang & Junran Lichen & Pengxiang Pan, 2024. "Approximation algorithms for solving the trip-constrained vehicle routing cover problems," Journal of Combinatorial Optimization, Springer, vol. 48(3), pages 1-24, October.
    17. 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.
    18. Alfandari, Laurent & Ljubić, Ivana & De Melo da Silva, Marcos, 2022. "A tailored Benders decomposition approach for last-mile delivery with autonomous robots," European Journal of Operational Research, Elsevier, vol. 299(2), pages 510-525.
    19. Liu, Bingsheng & Sheu, Jiuh-Biing & Zhao, Xue & Chen, Yuan & Zhang, Wei, 2020. "Decision making on post-disaster rescue routing problems from the rescue efficiency perspective," European Journal of Operational Research, Elsevier, vol. 286(1), pages 321-335.
    20. 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.

    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:49:y:2025:i:3:d:10.1007_s10878-025-01278-3. 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.