{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:10:23Z","timestamp":1725541823139},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642114083"},{"type":"electronic","value":"9783642114090"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11409-0_10","type":"book-chapter","created":{"date-parts":[[2009,12,3]],"date-time":"2009-12-03T13:12:27Z","timestamp":1259845947000},"page":"112-121","source":"Crossref","is-referenced-by-count":1,"title":["An Exact Algorithm for Minimum Distortion Embedding"],"prefix":"10.1007","author":[{"given":"Fedor V.","family":"Fomin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Lokshtanov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saket","family":"Saurabh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"B\u0103doiu, M., Chuzhoy, J., Indyk, P., Sidiropoulos, A.: Low-distortion embeddings of general metrics into the line. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC), ACM, pp. 225\u2013233 (2005)","DOI":"10.1145\/1060590.1060624"},{"key":"10_CR2","first-page":"119","volume-title":"Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"M. B\u0103doiu","year":"2005","unstructured":"B\u0103doiu, M., Dhamdhere, K., Gupta, A., Rabinovich, Y., R\u00e4cke, H., Ravi, R., Sidiropoulos, A.: Approximation algorithms for low-distortion embeddings into low-dimensional spaces. In: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 119\u2013128. SIAM, Philadelphia (2005)"},{"key":"10_CR3","unstructured":"Badoiu, M., Indyk, P., Sidiropoulos, A.: Approximation algorithms for embedding general metrics into trees. In: Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 512\u2013521. ACM, SIAM (2007)"},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/978-3-540-92248-3_10","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M. Cygan","year":"2008","unstructured":"Cygan, M., Pilipczuk, M.: Faster Exact Bandwidth. In: Broersma, H., Erlebach, T., Friedetzky, T., Paulusma, D. (eds.) WG 2008. LNCS, vol.\u00a05344, pp. 101\u2013109. Springer, Heidelberg (2008)"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/3-540-44985-X_2","volume-title":"Algorithm Theory - SWAT 2000","author":"U. Feige","year":"2000","unstructured":"Feige, U.: Coping with the NP-hardness of the graph bandwidth problem. In: Halld\u00f3rsson, M.M. (ed.) SWAT 2000. LNCS, vol.\u00a01851, pp. 10\u201319. Springer, Heidelberg (2000)"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1007\/978-3-642-02927-1_39","volume-title":"ICALP 2009","author":"M.R. Fellows","year":"2009","unstructured":"Fellows, M.R., Fomin, F.V., Lokshtanov, D., Losievskaja, E., Rosamond, F.A., Saurabh, S.: Distortion is Fixed Parameter Tractable. In: Albers, S., et al. (eds.) ICALP 2009. LNCS, vol.\u00a05555, pp. 463\u2013474. Springer, Heidelberg (2009)"},{"key":"10_CR7","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 l $_{\\mbox{1}}$ -embeddings of graphs. Combinatorica\u00a024, 233\u2013269 (2004)","journal-title":"Combinatorica"},{"key":"10_CR8","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1109\/SFCS.2001.959878","volume-title":"Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science (FOCS)","author":"P. Indyk","year":"2001","unstructured":"Indyk, P.: Algorithmic applications of low-distortion geometric embeddings. In: Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science (FOCS), pp. 10\u201333. IEEE, Los Alamitos (2001)"},{"key":"10_CR9","first-page":"272","volume-title":"Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC)","author":"C. Kenyon","year":"2004","unstructured":"Kenyon, C., Rabani, Y., Sinclair, A.: Low distortion maps between point sets. In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC), pp. 272\u2013280. ACM Press, New York (2004)"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Linial, N.: Finite metric-spaces\u2014combinatorics, geometry and algorithms. In: Proceedings of the International Congress of Mathematicians, Beijing, vol.\u00a0III, pp. 573\u2013586. Higher Ed. Press (2002)","DOI":"10.1145\/513400.513441"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11409-0_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:40:18Z","timestamp":1606185618000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11409-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642114083","9783642114090"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11409-0_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}