{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:10:38Z","timestamp":1725567038775},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540280613"},{"type":"electronic","value":"9783540318064"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11533719_20","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T09:34:13Z","timestamp":1127813653000},"page":"179-187","source":"Crossref","is-referenced-by-count":1,"title":["Bicriteria Network Design via Iterative Rounding"],"prefix":"10.1007","author":[{"given":"Piotr","family":"Krysta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"20_CR1","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1137\/S0097539792236237","volume":"24","author":"A. Agrawal","year":"1995","unstructured":"Agrawal, A., Klein, P., Ravi, R.: When trees collide: An approximation algorithm for the generalized Steiner problem on networks. SIAM Journal on Computing\u00a024(3), 445\u2013456 (1995)","journal-title":"SIAM Journal on Computing"},{"key":"20_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/BFb0030828","volume-title":"Computing and Combinatorics","author":"J.L. Ganley","year":"1995","unstructured":"Ganley, J.L., Golin, M.J., Salowe, J.S.: The Mutli-Weighted Spanning Tree Problem. In: Li, M., Du, D.-Z. (eds.) COCOON 1995. LNCS, vol.\u00a0959, pp. 141\u2013150. Springer, Heidelberg (1995)"},{"key":"20_CR3","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1137\/S0097539793242618","volume":"24","author":"M.X. Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: A General Approximation Technique for Constrained Forest Problems. SIAM Journal on Computing\u00a024, 296\u2013317 (1995)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"20_CR4","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s004930170004","volume":"21","author":"K. Jain","year":"2001","unstructured":"Jain, K.: A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem. Combinatorica\u00a021(1), 39\u201360 (2001), Available at \n                    \n                      http:\/\/www.cc.gatech.edu\/people\/home\/kjain\/","journal-title":"Combinatorica"},{"key":"20_CR5","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1145\/174652.174654","volume":"41","author":"S. Khuller","year":"1994","unstructured":"Khuller, S., Vishkin, U.: Biconnectivity approximations and graph carvings. Journal of the ACM\u00a041, 214\u2013235 (1994)","journal-title":"Journal of the ACM"},{"key":"20_CR6","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1006\/jagm.1998.0930","volume":"28","author":"M.V. Marathe","year":"1998","unstructured":"Marathe, M.V., Ravi, R., Sundaram, R., Ravi, S.S., Rosenkrantz, D.J., Hunt III., H.B.: Bicriteria Network Design. Journal of Algorithms\u00a028, 142\u2013171 (1998)","journal-title":"Journal of Algorithms"},{"key":"20_CR7","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0196-6774(92)90006-X","volume":"13","author":"C.H. Norton","year":"1992","unstructured":"Norton, C.H., Plotkin, S.A., Tardos, \u00c9.: Using Separation Algorithms in Fixed Dimension. Journal of Algorithms\u00a013, 79\u201398 (1992)","journal-title":"Journal of Algorithms"},{"key":"20_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/3-540-61422-2_121","volume-title":"Algorithm Theory - SWAT \u201996","author":"R. Ravi","year":"1996","unstructured":"Ravi, R., Goemans, M.X.: The Constrained Minimum Spanning Tree Problem. In: Karlsson, R., Lingas, A. (eds.) SWAT 1996. LNCS, vol.\u00a01097, pp. 66\u201375. Springer, Heidelberg (1996)"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Ravi, R., Marathe, M.V., Ravi, S.S., Rosenkrantz, D.J., Hunt III., H.B.: Many birds with one stone: multi-objective approximation algorithms. In: The Proc. 25th ACM Symposium on Theory of Computing, STOC (1993)","DOI":"10.1145\/167088.167209"},{"key":"20_CR10","unstructured":"Robins, G., Zelikovsky, A.: Improved Steiner Tree Approximation in Graphs. In: The Proc. 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 770\u2013779 (2000)"},{"key":"20_CR11","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Wiley, Chichester (1986)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11533719_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T04:12:50Z","timestamp":1553141570000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11533719_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540280613","9783540318064"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11533719_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}