{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,11]],"date-time":"2025-02-11T20:40:03Z","timestamp":1739306403637,"version":"3.37.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642036842"},{"type":"electronic","value":"9783642036859"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03685-9_18","type":"book-chapter","created":{"date-parts":[[2009,8,21]],"date-time":"2009-08-21T02:39:51Z","timestamp":1250822391000},"page":"231-243","source":"Crossref","is-referenced-by-count":3,"title":["Approximating Some Network Design Problems with Node Costs"],"prefix":"10.1007","author":[{"given":"Guy","family":"Kortsarz","sequence":"first","affiliation":[]},{"given":"Zeev","family":"Nutov","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Andrews, M.: Hardness of buy-at-bulk network design. In: Proc. FOCS, pp. 115\u2013124 (2004)","DOI":"10.1109\/FOCS.2004.32"},{"issue":"2","key":"18_CR2","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/s00453-002-0968-3","volume":"34","author":"M. Andrews","year":"2002","unstructured":"Andrews, M., Zhang, L.: Approximation algorithms for access network design. Algorithmica\u00a034(2), 197\u2013215 (2002)","journal-title":"Algorithmica"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Antonakopoulos, S., Chekuri, C., Shepherd, F.B., Zhang, L.: Buy-at-bulk network design with protection. In: FOCS, pp. 634\u2013644 (2007)","DOI":"10.1109\/FOCS.2007.21"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Charikar, M., Karagiozova, A.: On non-uniform multicommodity buy-at-bulk network design. In: Proc. STOC, pp. 176\u2013182 (2005)","DOI":"10.1145\/1060590.1060617"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Hajiaghayi, M.T., Kortsarz, G., Salavatipour, M.R.: Approximation algorithms for non-uniform buy-at-bulk network design. In: Proc. FOCS, pp. 677\u2013686 (2006)","DOI":"10.1109\/FOCS.2006.15"},{"key":"18_CR6","unstructured":"Chekuri, C., Hajiaghayi, M.T., Kortsarz, G., Salavatipour, M.R.: Approximation algorithms for node-weighted buy-at-bulk network design. In: SODA, pp. 1265\u20131274 (2007)"},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U. Feige","year":"1998","unstructured":"Feige, U.: A threshold of for approximating set cover. J. ACM\u00a045, 634\u2013652 (1998)","journal-title":"J. ACM"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Guha, S., Moss, A., Naor, J.S., Schieber, B.: Efficient recovery from power outage. In: Proc. STOC, pp. 574\u2013582 (1999)","DOI":"10.1145\/301250.301406"},{"key":"18_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/11830924_16","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"M.T. Hajiaghayi","year":"2006","unstructured":"Hajiaghayi, M.T., Kortsarz, G., Salavatipour, M.R.: Approximating buy-at-bulk and shallow-light k-steiner trees. In: D\u00edaz, J., Jansen, K., Rolim, J.D.P., Zwick, U. (eds.) APPROX 2006. LNCS, vol.\u00a04110, pp. 152\u2013163. Springer, Heidelberg (2006)"},{"issue":"1","key":"18_CR10","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1006\/jagm.1995.1029","volume":"19","author":"C. Klein","year":"1995","unstructured":"Klein, C., Ravi, R.: A nearly best-possible approximation algorithm for node-weighted steiner trees. Journal of Algorithms\u00a019(1), 104\u2013115 (1995)","journal-title":"Journal of Algorithms"},{"issue":"1","key":"18_CR11","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 problems. J. Algorithms\u00a028(1), 142\u2013171 (1998)","journal-title":"J. Algorithms"},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"Moss, A., Rabani, Y.: Approximation algorithms for constrained node weighted Steiner tree problems. In: Proc. STOC, pp. 373\u2013382 (2001)","DOI":"10.1145\/380752.380826"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Raz, R., Safra, S.: A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP. In: Proc. STOC, pp. 475\u2013484 (1997)","DOI":"10.1145\/258533.258641"},{"issue":"3","key":"18_CR14","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1137\/S1052623497321432","volume":"11","author":"F.S. Salman","year":"2000","unstructured":"Salman, F.S., Cheriyan, J., Ravi, R., Subramanian, S.: Approximating the single-sink link-installation problem in network design. SIAM J. on Optimization\u00a011(3), 595\u2013610 (2000)","journal-title":"SIAM J. on Optimization"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03685-9_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,11]],"date-time":"2025-02-11T20:24:08Z","timestamp":1739305448000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03685-9_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642036842","9783642036859"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03685-9_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}