Abstract
Let G be an unweighted graph on n vertices. We show that an embedding of the shortest path metric of G into the line with minimum distortion can be found in time 5n + o(n). This is the first algorithm breaking the trivial n!-barrier.
Partially supported by the Research Council of Norway.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bădoiu, 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–233 (2005)
Bădoiu, M., Dhamdhere, K., Gupta, A., Rabinovich, Y., Räcke, 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–128. SIAM, Philadelphia (2005)
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–521. ACM, SIAM (2007)
Cygan, M., Pilipczuk, M.: Faster Exact Bandwidth. In: Broersma, H., Erlebach, T., Friedetzky, T., Paulusma, D. (eds.) WG 2008. LNCS, vol. 5344, pp. 101–109. Springer, Heidelberg (2008)
Feige, U.: Coping with the NP-hardness of the graph bandwidth problem. In: Halldórsson, M.M. (ed.) SWAT 2000. LNCS, vol. 1851, pp. 10–19. Springer, Heidelberg (2000)
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. 5555, pp. 463–474. Springer, Heidelberg (2009)
Gupta, A., Newman, I., Rabinovich, Y., Sinclair, A.: Cuts, trees and l\(_{\mbox{1}}\)-embeddings of graphs. Combinatorica 24, 233–269 (2004)
Indyk, P.: Algorithmic applications of low-distortion geometric embeddings. In: Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science (FOCS), pp. 10–33. IEEE, Los Alamitos (2001)
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–280. ACM Press, New York (2004)
Linial, N.: Finite metric-spaces—combinatorics, geometry and algorithms. In: Proceedings of the International Congress of Mathematicians, Beijing, vol. III, pp. 573–586. Higher Ed. Press (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fomin, F.V., Lokshtanov, D., Saurabh, S. (2010). An Exact Algorithm for Minimum Distortion Embedding. In: Paul, C., Habib, M. (eds) Graph-Theoretic Concepts in Computer Science. WG 2009. Lecture Notes in Computer Science, vol 5911. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11409-0_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-11409-0_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-11408-3
Online ISBN: 978-3-642-11409-0
eBook Packages: Computer ScienceComputer Science (R0)