{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T14:11:25Z","timestamp":1758636685792,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540434009"},{"type":"electronic","value":"9783540459958"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"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":[[2002]]},"DOI":"10.1007\/3-540-45995-2_45","type":"book-chapter","created":{"date-parts":[[2007,5,30]],"date-time":"2007-05-30T02:33:34Z","timestamp":1180492414000},"page":"516-527","source":"Crossref","is-referenced-by-count":2,"title":["Flow Metrics"],"prefix":"10.1007","author":[{"given":"Claudson F.","family":"Bornstein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Santosh","family":"Vempala","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,3,14]]},"reference":[{"key":"45_CR1","doi-asserted-by":"crossref","unstructured":"Y. Bartal, \u201cProbabilistic Approximation of Metric Spaces and its Algorithmic Applications,\u201d Proc. of the 37th Ann. IEEE Symp. on Foundations of Computer Science, 184\u2013193, 1996.","DOI":"10.1109\/SFCS.1996.548477"},{"key":"45_CR2","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0304-3975(99)00181-4","volume":"235","author":"A. Blum","year":"2000","unstructured":"A. Blum, G. Konjevod, R. Ravi and S. Vempala, \u201cSemi-Definite Relaxation for Minimum Bandwidth and other Vertex-Ordering Problems,\u201d Theoretical Computer Science, 235 (2000), 25\u201342. Preliminary version in Proc. 30th ACM Symposium on the Theory of Computing, Dallas, 1998.","journal-title":"Theoretical Computer Science"},{"key":"45_CR3","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1006\/jagm.1995.1009","volume":"18","author":"H. L. Bodlaender","year":"1995","unstructured":"H. L. Bodlaender, J. R. Gilbert, H. Hafsteinsson, T. Klok, \u201cApproximating Treewidth, Pathwidth, and Minimum Elimination Tree Height,\u201d Journal of Algorithms 18 (1995) 238\u2013255.","journal-title":"Journal of Algorithms"},{"key":"45_CR4","doi-asserted-by":"crossref","unstructured":"M. M. Deza and M. Laurent, Geometry of cuts and metrics, Springer-Verlag, 1997.","DOI":"10.1007\/978-3-642-04295-9"},{"key":"45_CR5","doi-asserted-by":"crossref","unstructured":"J. Dunagan and S. Vempala, \u201cOn Euclidean embeddings and bandwidth minimization,\u201d Proc. of the 5th Intl. Symp. on Randomization and Approximation techniques in Computer Science, 229\u2013240, 2001.","DOI":"10.1007\/3-540-44666-4_26"},{"key":"45_CR6","doi-asserted-by":"crossref","unstructured":"G. Even. J. Naor, S. Rao and B. Schieber, \u201cDivide-and-conquer approximation algorithms via spreading metrics,\u201d Proceedings of the 35th Annual Conference on Foundations of Computer Science, 62\u201371, 1995.","DOI":"10.1109\/SFCS.1995.492463"},{"key":"45_CR7","doi-asserted-by":"crossref","unstructured":"M. Gr\u00f6tschel, L. Lov\u00e1sz, A. Schrijver, Geometric Algorithms and Combinatorial Optimization, Springer, 1988.","DOI":"10.1007\/978-3-642-97881-4"},{"key":"45_CR8","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"M. Goemans","year":"1995","unstructured":"M. Goemans and D. Williamson, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming, JACM, 42: 1115\u20131145, 1995.","journal-title":"JACM"},{"key":"45_CR9","doi-asserted-by":"crossref","unstructured":"T. Leighton and S. Rao. \u201cAn approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms.\u201d In Proc. of 28th FOCS, pp256\u201369, 1988.","DOI":"10.1109\/SFCS.1988.21958"},{"key":"45_CR10","unstructured":"S. Rao and A. Richa, \u201cNew Approximation Techniques for Some Ordering Problems,\u201d Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 211\u2013218, 1998."}],"container-title":["Lecture Notes in Computer Science","LATIN 2002: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45995-2_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T19:25:33Z","timestamp":1737055533000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45995-2_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540434009","9783540459958"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-45995-2_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2002]]}}}