{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T05:35:16Z","timestamp":1648791316762},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,5,9]],"date-time":"2012-05-09T00:00:00Z","timestamp":1336521600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2014,1]]},"DOI":"10.1007\/s10878-012-9497-4","type":"journal-article","created":{"date-parts":[[2012,5,8]],"date-time":"2012-05-08T14:38:28Z","timestamp":1336487908000},"page":"152-163","source":"Crossref","is-referenced-by-count":1,"title":["The subdivision-constrained routing requests problem"],"prefix":"10.1007","volume":"27","author":[{"given":"Jianping","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weidong","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junran","family":"Lichen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,5,9]]},"reference":[{"key":"9497_CR1","volume-title":"Network flows: theory, algorithms, and applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows: theory, algorithms, and applications. Prentice\u00a0Hall, New York"},{"key":"9497_CR2","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1006\/jagm.1999.1042","volume":"33","author":"M Charikar","year":"1999","unstructured":"Charikar M, Chekuri C, Cheung TY, Dai Z, Goel A, Guha S, Li M (1999) Approximation algorithms for directed Steiner problem. J Algorithms 33:73\u201391","journal-title":"J Algorithms"},{"key":"9497_CR3","doi-asserted-by":"crossref","DOI":"10.1145\/1921659.1921664","volume":"7","author":"C Chekuri","year":"2011","unstructured":"Chekuri C, Even G, Gupta A, Segev D (2011) Set connectivity problems in undirected graphs and the directed Steiner network problem. ACM Trans Algorithms 7:18","journal-title":"ACM Trans Algorithms"},{"key":"9497_CR4","first-page":"230","volume-title":"Proceedings of the twelfth annual ACM-SIAM symposium on discrete algorithms (SODA01)","author":"G Chen","year":"2001","unstructured":"Chen G, Xue G (2001) K-pair delay constrained minimum cost routing in undirected networks. In: Proceedings of the twelfth annual ACM-SIAM symposium on discrete algorithms (SODA01), pp\u00a0230\u2013231"},{"key":"9497_CR5","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1023\/A:1008384012064","volume":"18","author":"D Chen","year":"2000","unstructured":"Chen D, Du DZ, Hu XD, Lin GH, Wang L, Xue G (2000) Approximation for Steienr trees with minimum number of Steiner points. J Glob Optim 18:17\u201333","journal-title":"J Glob Optim"},{"key":"9497_CR6","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/s11276-006-0724-8","volume":"14","author":"X Cheng","year":"2008","unstructured":"Cheng X, Du DZ, Wang L, Xu B (2008) Relay sensor placement in wireless sensor networks. Wirel Netw 14:347\u2013355","journal-title":"Wirel Netw"},{"key":"9497_CR7","first-page":"750","volume-title":"Proceedings of the 31st annual ACM symposium on theory of computing","author":"Y Dodis","year":"1999","unstructured":"Dodis Y, Khanna S (1999) Designing networks with bounded pairwise distance. In: Proceedings of the 31st annual ACM symposium on theory of computing. Atlanta, GA, pp\u00a0750\u2013759"},{"key":"9497_CR8","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0020-0190(02)00205-3","volume":"83","author":"F Ergun","year":"2002","unstructured":"Ergun F, Sinha R, Zhang L (2002) An improved FPTAS for restricted shortest path. Inf Process Lett 83:287\u2013291","journal-title":"Inf Process Lett"},{"key":"9497_CR9","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U Feige","year":"1998","unstructured":"Feige U (1998) A threshold of lnn for approximating set cover. J Assoc Comput Mach 45:634\u2013652","journal-title":"J Assoc Comput Mach"},{"key":"9497_CR10","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, San Francisco"},{"key":"9497_CR11","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1287\/moor.17.1.36","volume":"17","author":"R Hassin","year":"1992","unstructured":"Hassin R (1992) Approximation schemes for the restricted shortest path problem. Math Oper Res 17:36\u201342","journal-title":"Math Oper Res"},{"key":"9497_CR12","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1016\/j.tcs.2008.12.038","volume":"410","author":"J Li","year":"2009","unstructured":"Li J, Li W, Zhang T, Zhang Z (2009) The subdivision-constrained minimum spanning tree problem. Theor Comput Sci 410:877\u2013885","journal-title":"Theor Comput Sci"},{"key":"9497_CR13","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/S0020-0190(98)00201-4","volume":"69","author":"G Lin","year":"1999","unstructured":"Lin G, Xue G (1999) Steiner tree problem with minimum number of Steiner points and bounded edge-length. Inf Process Lett 69:53\u201357","journal-title":"Inf Process Lett"},{"key":"9497_CR14","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/S0020-0190(00)00095-8","volume":"75","author":"II Mandoiu","year":"2000","unstructured":"Mandoiu II, Zelikovsky AZ (2000) A note on the MST heuristic for bounded edge-length Steiner trees with minimum number of Steiner points. Inf Process Lett 75:165\u2013167","journal-title":"Inf Process Lett"},{"key":"9497_CR15","first-page":"776","volume-title":"Proceedings 25th annual ACM symposium on the theory of computing","author":"C Phillips","year":"1993","unstructured":"Phillips C (1993) The network inhibition problem. In: Proceedings 25th annual ACM symposium on the theory of computing. San Diego, CA, May 1993, pp\u00a0776\u2013785"},{"key":"9497_CR16","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"RC Prim","year":"1957","unstructured":"Prim RC (1957) Shortest connection networks and some generalizations. Bell Syst Tech J 36:1389\u20131401","journal-title":"Bell Syst Tech J"},{"key":"9497_CR17","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1287\/opre.35.1.70","volume":"35","author":"A Warburton","year":"1987","unstructured":"Warburton A (1987) Approximation of Pareto optima in multiple-objective, shortest path problems. Oper Res 35:70\u201379","journal-title":"Oper Res"},{"key":"9497_CR18","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/s00453-004-1119-9","volume":"41","author":"G Xue","year":"2005","unstructured":"Xue G, Xiao W (2005) A polynomial-time approximation scheme for minimum cost delay-constrained multicast tree under a steiner topology. Algorithmica 41:53\u201372","journal-title":"Algorithmica"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-012-9497-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-012-9497-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-012-9497-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:23:18Z","timestamp":1559262198000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-012-9497-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,9]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,1]]}},"alternative-id":["9497"],"URL":"https:\/\/doi.org\/10.1007\/s10878-012-9497-4","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,5,9]]}}}