IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v44y2022i3d10.1007_s10878-020-00543-x.html
   My bibliography  Save this article

Approximation algorithms for constructing required subgraphs using stock pieces of fixed length

Author

Listed:
  • Junran Lichen

    (Yunnan University)

  • Jianping Li

    (Yunnan University)

  • Ko-Wei Lih

    (Academia Sinica)

  • Xingxing Yu

    (Georgia Institute of Technology)

Abstract

In this paper, we address the problem of constructing required subgraphs using stock pieces of fixed length (CRS-SPFL, for short), which is a new variant of the minimum-cost edge-weighted subgraph (MCEWS, for short) problem. Concretely, for the MCEWS problem Q, it is asked to choose a minimum-cost subset of edges from a given graph G such that these edges can form a required subgraph $$G'$$ G ′ . For the CRS-SPFL problem $$Q^{\prime }$$ Q ′ , these edges in such a required subgraph $$G'$$ G ′ are further asked to be constructed by plus using some stock pieces of fixed length L. The new objective, however, is to minimize the total cost to construct such a required subgraph $$G'$$ G ′ , where the total cost is sum of the cost to purchase stock pieces of fixed length L and the cost to construct all edges in such a subgraph $$G'$$ G ′ . We obtain the following three main results. (1) Given an $$\alpha $$ α -approximation algorithm to solve the MCEWS problem, where $$\alpha \ge 1$$ α ≥ 1 (for the case $$\alpha =1$$ α = 1 , the MCEWS problem Q is solved optimally by a polynomial-time exact algorithm), we design a $$2\alpha $$ 2 α -approximation algorithm and another asymptotic $$\frac{7\alpha }{4}$$ 7 α 4 -approximation algorithm to solve the CRS-SPFL problem $$Q^{\prime }$$ Q ′ , respectively; (2) When Q is the minimum spanning tree problem, we provide a $$\frac{3}{2}$$ 3 2 -approximation algorithm and an AFPTAS to solve the problem $$Q^{\prime }$$ Q ′ of constructing a spanning tree using stock pieces of fixed length L, respectively; (3) When Q is the single-source shortest paths tree problem, we present a $$\frac{3}{2}$$ 3 2 -approximation algorithm and an AFPTAS to solve the problem $$Q^{\prime }$$ Q ′ of constructing a single-source shortest paths tree using stock pieces of fixed length L, respectively.

Suggested Citation

  • Junran Lichen & Jianping Li & Ko-Wei Lih & Xingxing Yu, 2022. "Approximation algorithms for constructing required subgraphs using stock pieces of fixed length," Journal of Combinatorial Optimization, Springer, vol. 44(3), pages 1774-1795, October.
  • Handle: RePEc:spr:jcomop:v:44:y:2022:i:3:d:10.1007_s10878-020-00543-x
    DOI: 10.1007/s10878-020-00543-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-020-00543-x
    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-020-00543-x?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. Refael Hassin, 1992. "Approximation Schemes for the Restricted Shortest Path Problem," Mathematics of Operations Research, INFORMS, vol. 17(1), pages 36-42, February.
    2. Li, Jianping & Ge, Yu & He, Shuai & Lichen, Junran, 2014. "Approximation algorithms for constructing some required structures in digraphs," European Journal of Operational Research, Elsevier, vol. 232(2), pages 307-314.
    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. Junran Lichen & Jianping Li & Ko-Wei Lih & Xingxing Yu, 0. "Approximation algorithms for constructing required subgraphs using stock pieces of fixed length," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-22.
    2. Esaignani Selvarajah & Rui Zhang, 2014. "Supply chain scheduling to minimize holding costs with outsourcing," Annals of Operations Research, Springer, vol. 217(1), pages 479-490, June.
    3. Randeep Bhatia & Sudipto Guha & Samir Khuller & Yoram J. Sussmann, 1998. "Facility Location with Dynamic Distance Functions," Journal of Combinatorial Optimization, Springer, vol. 2(3), pages 199-217, September.
    4. Geng, Zhichao & Yuan, Jinjiang, 2023. "Single-machine scheduling of multiple projects with controllable processing times," European Journal of Operational Research, Elsevier, vol. 308(3), pages 1074-1090.
    5. Boaz Golany & Moshe Kress & Michal Penn & Uriel G. Rothblum, 2012. "Network Optimization Models for Resource Allocation in Developing Military Countermeasures," Operations Research, INFORMS, vol. 60(1), pages 48-63, February.
    6. Xie, Chi & Travis Waller, S., 2012. "Parametric search and problem decomposition for approximating Pareto-optimal paths," Transportation Research Part B: Methodological, Elsevier, vol. 46(8), pages 1043-1067.
    7. Faramroze G. Engineer & George L. Nemhauser & Martin W. P. Savelsbergh, 2011. "Dynamic Programming-Based Column Generation on Time-Expanded Networks: Application to the Dial-a-Flight Problem," INFORMS Journal on Computing, INFORMS, vol. 23(1), pages 105-119, February.
    8. Buu-Chau Truong & Kim-Hung Pho & Van-Buol Nguyen & Bui Anh Tuan & Wing-Keung Wong, 2019. "Graph Theory And Environmental Algorithmic Solutions To Assign Vehicles Application To Garbage Collection In Vietnam," Advances in Decision Sciences, Asia University, Taiwan, vol. 23(3), pages 1-35, September.
    9. Michael Holzhauser & Sven O. Krumke, 2018. "A generalized approximation framework for fractional network flow and packing problems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 87(1), pages 19-50, February.
    10. Luigi Di Puglia Pugliese & Francesca Guerriero, 2013. "A Reference Point Approach for the Resource Constrained Shortest Path Problems," Transportation Science, INFORMS, vol. 47(2), pages 247-265, May.
    11. Chen, Xujin & Hu, Jie & Hu, Xiaodong, 2009. "A polynomial solvable minimum risk spanning tree problem with interval data," European Journal of Operational Research, Elsevier, vol. 198(1), pages 43-46, October.
    12. Jenkins , Alan, 2005. "Performance Appraisal Research: A Critical Review of Work on “The Social Context and Politics of Appraisal”," ESSEC Working Papers DR 05004, ESSEC Research Center, ESSEC Business School.
    13. Vittorio Bilò & Ioannis Caragiannis & Angelo Fanelli & Michele Flammini & Gianpiero Monaco, 2017. "Simple Greedy Algorithms for Fundamental Multidimensional Graph Problems," Post-Print hal-02089412, HAL.
    14. Jianping Li & Weidong Li & Junran Lichen, 2014. "The subdivision-constrained routing requests problem," Journal of Combinatorial Optimization, Springer, vol. 27(1), pages 152-163, January.
    15. Mattia, Sara & Rossi, Fabrizio & Servilio, Mara & Smriglio, Stefano, 2017. "Staffing and scheduling flexible call centers by two-stage robust optimization," Omega, Elsevier, vol. 72(C), pages 25-37.
    16. Sven O. Krumke & Madhav V. Marathe & Hartmut Noltemeier & R. Ravi & S. S. Ravi, 1998. "Approximation Algorithms for Certain Network Improvement Problems," Journal of Combinatorial Optimization, Springer, vol. 2(3), pages 257-288, September.
    17. Wei Ding & Guoliang Xue, 2014. "Minimum diameter cost-constrained Steiner trees," Journal of Combinatorial Optimization, Springer, vol. 27(1), pages 32-48, January.
    18. Sedeño-Noda, Antonio & Alonso-Rodríguez, Sergio, 2015. "An enhanced K-SP algorithm with pruning strategies to solve the constrained shortest path problem," Applied Mathematics and Computation, Elsevier, vol. 265(C), pages 602-618.
    19. Arne Herzel & Stefan Ruzika & Clemens Thielen, 2021. "Approximation Methods for Multiobjective Optimization Problems: A Survey," INFORMS Journal on Computing, INFORMS, vol. 33(4), pages 1284-1299, October.
    20. Goldberg, Noam & Poss, Michael, 2020. "Maximum probabilistic all-or-nothing paths," European Journal of Operational Research, Elsevier, vol. 283(1), pages 279-289.

    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:44:y:2022:i:3:d:10.1007_s10878-020-00543-x. 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.