{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:19:10Z","timestamp":1725664750339},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540614227"},{"type":"electronic","value":"9783540685296"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61422-2_118","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:37:40Z","timestamp":1330292260000},"page":"28-40","source":"Crossref","is-referenced-by-count":1,"title":["Service-constrained network design problems"],"prefix":"10.1007","author":[{"given":"Madhav V.","family":"Marathe","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Ravi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Sundaram","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"4_CR1","unstructured":"E. M. Arkin, S. P. Fekete, J. S. B. Mitchell and C. D. Piatko, \u201cOptimal Covering Tour Problems,\u201d Proceedings of the 5th International Symposium on Algorithms and Computation (1994)."},{"key":"4_CR2","unstructured":"E. M. Arkin and R. Hassin, \u201cApproximation algorithms for the geometric covering salesman problem,\u201d Technical Report #968, School of OR&IE, Cornell University, July 1991. (To appear in Discrete Applied Mathematics."},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1137\/S0097539792236237","volume":"24","author":"A. Agrawal","year":"1995","unstructured":"A. Agrawal, P. Klein and R. Ravi, \u201cWhen trees collide: an approximation problem for the generalized Steiner problem on networks,\u201d SIAM Journal on Computing, vol. 24, pp. 440\u2013456(1995).","journal-title":"SIAM Journal on Computing"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"A. Blum, R. Ravi and S. Vempala, \u201cA constant-factor approximation algorithm for the k-MST problem,\u201d To appear in the Proceedings of the 28th Annual ACM Symposium on the Theory of Computation (1996).","DOI":"10.1145\/237814.237992"},{"issue":"no.4","key":"4_CR5","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1137\/0603048","volume":"3","author":"P. M. Camerini","year":"1982","unstructured":"P. M. Camerini, and G. Galbiati, \u201cThe bounded path problem,\u201d SIAM Journal of Algebraic and Discrete Methods, vol. 3, no. 4, pp. 474\u2013484 (1982).","journal-title":"SIAM Journal of Algebraic and Discrete Methods"},{"key":"4_CR6","volume-title":"Introduction to Algorithms","author":"T. H. Cormen","year":"1990","unstructured":"T. H. Cormen, C. E. Leiserson and R. Rivest, Introduction to Algorithms, MIT Press, Boston (1990)."},{"key":"4_CR7","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1287\/trsc.23.3.208","volume":"23","author":"J. T. Current","year":"1989","unstructured":"J. T. Current and D. A. Schilling, \u201cThe covering salesman problem,\u201d Transportation Science, vol. 23, pp 208\u2013213 (1989).","journal-title":"Transportation Science"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"U. Feige, \u201cA threshold of ln n for approximating set cover,\u201d To appear in the Proceedings of the 28th Annual ACM Symposium on the Theory of Computation (1996).","DOI":"10.1145\/237814.237977"},{"key":"4_CR9","volume-title":"Computers and Intractability: A guide to the theory of NP-completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson, Computers and Intractability: A guide to the theory of NP-completeness, W. H. Freeman, San Francisco (1979)."},{"key":"4_CR10","unstructured":"P. E. Green, Fiber-Optic Networks, Prentice Hall (1992)."},{"key":"4_CR11","unstructured":"S. R. Kumar, A. Russell and R. Sundaram, \u201cFaster algorithms for optical switch configuration,\u201d submitted to IEEE Global Telecommunications Conference (1996)."},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"M. V. Marathe, R. Ravi, R. Sundaram, S. S. Ravi, D. J. Rosenkrantz and H. B. Hunt III, \u201cBicriteria network design problems,\u201d Proceedings of the International Colloquium on Automata, Languages and Programming, LNCS 944, pp. 487\u2013498 (1995).","DOI":"10.1007\/3-540-60084-1_99"},{"issue":"no.2","key":"4_CR13","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1109\/35.186364","volume":"31","author":"R. Ramaswami","year":"1993","unstructured":"R. Ramaswami, \u201cMulti-wavelength lightwave networks for computer communication,\u201d IEEE Communications Magazine, vol. 31, no. 2, pp. 78\u201388 (Feb. 1993).","journal-title":"IEEE Communications Magazine"},{"key":"4_CR14","unstructured":"R. Ravi, R. Sundaram, M. V. Marathe, D. J. Rosenkrantz, and S. S. Ravi, \u201cSpanning trees short or small,\u201d Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 546\u2013555 (1994)."},{"key":"4_CR15","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1145\/103140.103146","volume":"16","author":"O. Wolfson","year":"1991","unstructured":"O. Wolfson and A. Milo, \u201cThe multicast policy and its relationship to replicated data placement,\u201d ACM Transactions on Database Systems, vol. 16, pp 181\u2013205 (1991).","journal-title":"ACM Transactions on Database Systems"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2014 SWAT'96"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61422-2_118.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:05:56Z","timestamp":1605647156000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61422-2_118"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540614227","9783540685296"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-61422-2_118","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}