{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:57:02Z","timestamp":1725559022240},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540223399"},{"type":"electronic","value":"9783540278108"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27810-8_6","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T17:27:29Z","timestamp":1279042049000},"page":"51-63","source":"Crossref","is-referenced-by-count":0,"title":["Robust Subgraphs for Trees and Paths"],"prefix":"10.1007","author":[{"given":"Refael","family":"Hassin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danny","family":"Segev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","unstructured":"Arora, S., Karakostas, G.: A 2+ \u03b5 approximation algorithm for the k-MST problem. In: Proc. SIAM Symp. on Discrete Algorithms (2000)"},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/s004530010050","volume":"29","author":"U. Feige","year":"2001","unstructured":"Feige, U., Kortsarz, G., Peleg, D.: The dense k-subgraph problem. Algorithmica\u00a029, 410\u2013421 (2001)","journal-title":"Algorithmica"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Frederickson, G.N., Johnson, D.B.: Generating and searching sets induced by network , LNCS, vol.\u00a085, pp. 221\u2013233 (1980)","DOI":"10.1007\/3-540-10003-2_73"},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1016\/S0021-9800(68)80039-0","volume":"4","author":"D. Gale","year":"1968","unstructured":"Gale, D.: Optimal assignments in an ordered set: An application of matroid theory. J. of Combinatorial\u00a04, 176\u2013180 (1968)","journal-title":"J. of Combinatorial"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Garg, N.: A 3-approximation for the minimum tree spanning k vertices. In: Proc. IEEE Symp. on Foundations of Computer Science (1996), pp. 302\u2013309 (1996)","DOI":"10.1109\/SFCS.1996.548489"},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1287\/trsc.5.2.212","volume":"5","author":"A.J. Goldman","year":"1971","unstructured":"Goldman, A.J.: Optimal center location in simple networks. Transportation Sci.\u00a05, 212\u2013221 (1971)","journal-title":"Transportation Sci."},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1137\/S0895480198332156","volume":"15","author":"R. Hassin","year":"2002","unstructured":"Hassin, R., Rubinstein, S.: Robust matchings. SIAM J. Disc. Math.\u00a015, 530\u2013537 (2002)","journal-title":"SIAM J. Disc. Math."},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/S0167-6377(97)00034-5","volume":"21","author":"R. Hassin","year":"1997","unstructured":"Hassin, R., Rubinstein, S., Tamir, A.: Approximation algorithms for maximum dispersion. Operations Research Letters\u00a021, 133\u2013137 (1997)","journal-title":"Operations Research Letters"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1137\/0137040","volume":"37","author":"O. Kariv","year":"1979","unstructured":"Kariv, O., Hakimi, L.: An algorithmic approach to network location problems. I: The p-centers. SIAM J. Appl. Math.\u00a037, 513\u2013538 (1979)","journal-title":"SIAM J. Appl. Math."},{"key":"6_CR10","unstructured":"Mirchandani, P.B., Francis, R.L.: Discrete Location Theory, New York. Wiley- Interscience Series in Discrete Mathematics and Optimization (1990)"},{"key":"6_CR11","unstructured":"Lawler, E.: Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Winston (1976)"},{"key":"6_CR12","volume-title":"Approximation Algorithms","author":"V. Vazirani","year":"2001","unstructured":"Vazirani, V.: Approximation Algorithms. Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory - SWAT 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27810-8_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:21:46Z","timestamp":1605759706000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27810-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540223399","9783540278108"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27810-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}