Abstract
The problem of computing minimum distortion embeddings of a given graph into a line (path) was introduced in 2004 and has quickly attracted significant attention with subsequent results appearing in recent stoc and soda conferences. So far all such results concern approximation algorithms or exponential-time exact algorithms. We give the first polynomial-time algorithms for computing minimum distortion embeddings of graphs into a path when the input graphs belong to specific graph classes. In particular, we solve this problem in polynomial time for bipartite permutation graphs and threshold graphs.
This work is supported by the Research Council of Norway.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Badoiu, M., Chuzhoy, J., Indyk, P., Sidiropoulos, A.: Low-distortion embeddings of general metrics into the line. In: Proceedings of STOC 2005, pp. 225–233. ACM Press, New York (2005)
Badoiu, 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 SODA 2005, pp. 119–128. ACM and SIAM (2005)
Badoiu, M., Indyk, P., Sidiropoulos, A.: A constant-factor approximation algorithm for embedding unweighted graphs into trees. In: AI Lab Technical Memo AIM-2004-015, MIT Press, Cambridge (2004)
Blache, G., Karpinski, M., Wirtgen, J.: On approximation intractability of the bandwidth problem. Technical report TR98-014, University of Bonn (1997)
Brandstädt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey. SIAM Monog. Disc. Math. Appl. (1999)
Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs, 2nd edn. Ann. Disc. Math. vol. 57. Elsevier, Amsterdam (2004)
Heggernes, P., Kratsch, D., Meister, D.: Bandwidth of bipartite permutation graphs in polynomial time. In: Proceedings of LATIN 2008. LNCS, vol. 4957, pp. 216–227. Springer, Heidelberg (2008)
Heggernes, P., Meister, D., Proskurowski, A.: Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs. In: Reports in Informatics, University of Bergen, Norway, vol. 369 (2008)
Indyk, P.: Algorithmic applications of low-distortion geometric embeddings. In: Proceedings of FOCS 2001, pp. 10–35. IEEE, Los Alamitos (2005)
Indyk, P., Matousek, J.: Low-distortion embeddings of finite metric spaces. In: Handbook of Discrete and Computational Geometry, 2nd edn. pp. 177–196. CRC Press, Boca Raton (2004)
Kenyon, C., Rabani, Y., Sinclair, A.: Low distortion maps between point sets. In: Proceedings of STOC 2004, pp. 272–280. ACM Press, New York (2004)
Kleitman, D.J., Vohra, R.V.: Computing the bandwidth of interval graphs. SIAM J. Disc. Math. 3, 373–375 (1990)
Mahadev, N., Peled, U.: Threshold graphs and related topics. In: Ann. Disc. Math. vol. 56, North-Holland, Amsterdam (1995)
Monien, B.: The Bandwidth-Minimization Problem for Caterpillars with Hair Length 3 is NP-Complete. SIAM J. Alg. Disc. Meth. 7, 505–512 (1986)
Papadimitriou, C., Safra, S.: The complexity of low-distortion embeddings between point sets. In: Proceedings of SODA 2005, pp. 112–118. ACM and SIAM (2005)
Spinrad, J., Brandstädt, A., Stewart, L.: Bipartite permutation graphs. Disc. Appl. Math. 18, 279–292 (1987)
Sprague, A.P.: An O(n logn) algorithm for bandwidth of interval graphs. SIAM J. Disc. Math. 7, 213–220 (1994)
Tenenbaum, J.B., de Silva, V., Langford, J.C.: A global geometric framework for nonlinear dimensionality reduction. Science 290, 2319–2323 (2000)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Heggernes, P., Meister, D., Proskurowski, A. (2008). Minimum Distortion Embeddings into a Path of Bipartite Permutation and Threshold Graphs. In: Gudmundsson, J. (eds) Algorithm Theory – SWAT 2008. SWAT 2008. Lecture Notes in Computer Science, vol 5124. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69903-3_30
Download citation
DOI: https://doi.org/10.1007/978-3-540-69903-3_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69900-2
Online ISBN: 978-3-540-69903-3
eBook Packages: Computer ScienceComputer Science (R0)