Abstract
In this paper, we consider the problem of constructing required subgraphs using stock pieces of fixed length (CRS-SPFL, for short), which is a variant of the problem of minimum-cost edge-weighted subgraph constructions (MCEWSC, for short). This new problem has many important applications in our reality life, and it is defined as follows. In the MCEWSC problem Q, the objective is to choose a minimum-cost subset of edges from a graph such that these edges form a required subgraph (e.g., a spanning tree). In the CRS-SPFL problem \(Q^{\prime }\), these edges are further required to be constructed by some stock pieces of fixed length L, the new objective is to minimize the total cost to construct such a required subgraph \(G'\), where the total cost is sum of the cost to buy necessary these stock pieces and the cost to construct all edges in such a subgraph \(G'\).
We obtain the following three main results. (1) Whenever the MCEWSC problem Q can be approximated by an \(\alpha \)-approximation algorithm (for the case \(\alpha =1\), the MCEWSC problem Q is solved optimally by a polynomial-time exact algorithm), we can design a \(2\alpha \)-approximation algorithm to solve the CRS-SPFL problem \(Q^{\prime }\); (2) In addition, when the MCEWSC problem Q is to find a minimum spanning tree, we provide a \(\frac{3}{2}\)-approximation algorithm and an AFPTAS to solve the CRS-SPFL problem \(Q^{\prime }\), respectively; (3) Finally, when the MCEWSC problem Q is to find a single-source shortest paths tree, we present a \(\frac{3}{2}\)-approximation algorithm and an AFPTAS to solve the CRS-SPFL problem \(Q^{\prime }\), respectively.
Supported by the National Natural Science Foundation of China [No. 11861075], IRTSTYN, and Key Joint Project of Yunnan Provincial Science and Technology Department and Yunnan University [No. 2018FY001(-014)], Innovation Team Fostering Project of Yunnan Province.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Chen, D.H., Du, D.Z., Hu, X.D., Lin, G.H., Wang, L.S., Xue, G.: Approximation for Steiner trees with minimum number of Steiner points. J. Global Optim. 18, 17–33 (2000)
Coffman, E.G., Garey, M.R., Johnson, D.S.: Approximation algorithms for bin packing: a survey. In: Hochbaum, D. (ed.) Approximation Algorithms for NP-Hard Problems, pp. 46–93. PWS Publishing, Boston (1996)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H Freeman, San Francisco (1979)
Karmarkar, N., Karp, R.M.: An efficient approximation scheme for the one-dimensional bin-packing problem. In: Proceedings of 23rd Annual IEEE Symposium on Foundations of Computer Science, 3–5 November 1982, pp. 312–320 (1982)
Lin, G.H., Xue, G.L.: Steiner tree problem with minimum number of Steiner points and bounded edge-length. Inform. Process. Lett. 69, 53–57 (1999)
Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer, The Netherlands (2003)
Simchi-Levi, D.: New worst-case results for the bin-packing problem. Naval Res. Logist. 41, 579–585 (1994)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Lichen, J., Li, J., Lih, KW., Yu, X. (2019). On Approximations for Constructing Required Subgraphs Using Stock Pieces of Fixed Length. In: Du, DZ., Li, L., Sun, X., Zhang, J. (eds) Algorithmic Aspects in Information and Management. AAIM 2019. Lecture Notes in Computer Science(), vol 11640. Springer, Cham. https://doi.org/10.1007/978-3-030-27195-4_18
Download citation
DOI: https://doi.org/10.1007/978-3-030-27195-4_18
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-27194-7
Online ISBN: 978-3-030-27195-4
eBook Packages: Computer ScienceComputer Science (R0)