{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T16:03:32Z","timestamp":1787501012585,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642153686","type":"print"},{"value":"9783642153693","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-15369-3_12","type":"book-chapter","created":{"date-parts":[[2010,8,27]],"date-time":"2010-08-27T00:01:36Z","timestamp":1282867296000},"page":"152-165","source":"Crossref","is-referenced-by-count":5,"title":["Vertex Sparsifiers: New Results from Old Techniques"],"prefix":"10.1007","author":[{"given":"Matthias","family":"Englert","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Anupam","family":"Gupta","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Robert","family":"Krauthgamer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Harald","family":"R\u00e4cke","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Inbal","family":"Talgam-Cohen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kunal","family":"Talwar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"12_CR1","unstructured":"Andersen, R., Feige, U.: Interchanging distance and capacity in probabilistic mappings. CoRR, abs\/0907.3631 (2009)"},{"key":"12_CR2","unstructured":"Archer, A., Fakcharoenphol, J., Harrelson, C., Krauthgamer, R., Talwar, K., Tardos, \u00c9.: Approximate classification via earthmover metrics. In: Proc. 15th SODA, pp. 1079\u20131087 (2004)"},{"issue":"2","key":"12_CR3","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1137\/S0097539701395978","volume":"34","author":"G. Calinescu","year":"2004","unstructured":"Calinescu, G., Karloff, H.J., Rabani, Y.: Approximation algorithms for the 0-extension problem. SIAM J. Comput.\u00a034(2), 358\u2013372 (2004)","journal-title":"SIAM J. Comput."},{"key":"12_CR4","unstructured":"Fakcharoenphol, J., Harrelson, C., Rao, S., Talwar, K.: An improved approximation algorithm for the 0-extension problem. In: Proc. 14th SODA, pp. 257\u2013265 (2003)"},{"issue":"3","key":"12_CR5","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1016\/j.jcss.2004.04.011","volume":"69","author":"J. Fakcharoenphol","year":"2004","unstructured":"Fakcharoenphol, J., Rao, S., Talwar, K.: A tight bound on approximating arbitrary metrics by tree metrics. J. Comput. System Sci.\u00a069(3), 485\u2013497 (2004)","journal-title":"J. Comput. System Sci."},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1007\/978-3-540-45198-3_4","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"J. Fakcharoenphol","year":"2003","unstructured":"Fakcharoenphol, J., Talwar, K.: Improved decompositions of graphs with forbidden minors. In: Arora, S., Jansen, K., Rolim, J.D.P., Sahai, A. (eds.) 6th APPROX. LNCS, vol.\u00a02764, pp. 36\u201346. Springer, Heidelberg (2003)"},{"issue":"4","key":"12_CR7","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1016\/j.orl.2010.02.009","volume":"38","author":"A. Gupta","year":"2010","unstructured":"Gupta, A., Nagarajan, V., Ravi, R.: Improved approximation algorithms for requirement cut. Operations Research Letters\u00a038(4), 322\u2013325 (2010)","journal-title":"Operations Research Letters"},{"issue":"2","key":"12_CR8","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s00493-004-0015-x","volume":"24","author":"A. Gupta","year":"2004","unstructured":"Gupta, A., Newman, I., Rabinovich, Y., Sinclair, A.: Cuts, trees and \u21131-embeddings of graphs. Combinatorica\u00a024(2), 233\u2013269 (2004)","journal-title":"Combinatorica"},{"key":"12_CR9","unstructured":"Gupta, A.: Steiner points in tree metrics don\u2019t (really) help. In: Proc. 12th SODA, pp. 220\u2013227 (2001)"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Klein, P., Plotkin, S.A., Rao, S.B.: Excluded minors, network decomposition, and multicommodity flow. In: Proc. 25th STOC, pp. 682\u2013690 (1993)","DOI":"10.1145\/167088.167261"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Leighton, T., Moitra, A.: Extensions and limits to vertex sparsification. In: Proc. 42th STOC, pp. 47\u201356 (2010)","DOI":"10.1145\/1806689.1806698"},{"issue":"1","key":"12_CR12","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s00222-004-0400-5","volume":"160","author":"J.R. Lee","year":"2005","unstructured":"Lee, J.R., Naor, A.: Extending Lipschitz functions via random metric partitions. Invent. Math.\u00a0160(1), 59\u201395 (2005)","journal-title":"Invent. Math."},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Lee, J.R., Sidiropoulos, A.: On the geometry of graphs with a forbidden minor. In: Proc. 41st STOC, pp. 245\u2013254 (2009)","DOI":"10.1145\/1536414.1536450"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Moitra, A.: Approximation algorithms for multicommodity-type problems with guarantees independent of the graph size. In: Proc. 50th FOCS, pp. 3\u201312 (2009)","DOI":"10.1109\/FOCS.2009.28"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Nowozin, S., Lampert, C.H.: Global connectivity potentials for random field models. In: Proc. 22nd CVPR, pp. 818\u2013825 (2009)","DOI":"10.1109\/CVPRW.2009.5206567"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"R\u00e4cke, H.: Optimal hierarchical decompositions for congestion minimization in net works. In: Proc. 40th STOC, pp. 255\u2013264 (2008)","DOI":"10.1145\/1374376.1374415"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Vicente, S., Kolmogorov, V., Rother, C.: Graph cut based image segmentation with connectivity priors. In: Proc. 21st CVPR (2008)","DOI":"10.1109\/CVPR.2008.4587440"}],"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-15369-3_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T17:22:31Z","timestamp":1558286551000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15369-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642153686","9783642153693"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15369-3_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}