Minimum distortion embeddings into a path of bipartite permutation and threshold graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5124 LNCS, Issue , 2008, Pages 331-342

  Heggernes, Pinar ^a   Meister, Daniel ^a   Proskurowski, Andrzej ^b  

^a UNIVERSITY OF BERGEN   (Norway)

^b UNIVERSITY OF OREGON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; COMPUTATIONAL GEOMETRY; GRAPH THEORY; POLYNOMIAL APPROXIMATION; POLYNOMIALS; TECHNICAL PRESENTATIONS; TREES (MATHEMATICS);

BIPARTITE PERMUTATION GRAPHS; COMPUTING; DISTORTION EMBEDDINGS; EXACT ALGORITHMS; GRAPH CLASSES; INPUT GRAPHS; OF GRAPHS; POLYNOMIAL TIMES; THRESHOLD GRAPHS; TIME ALGORITHMS;

APPROXIMATION ALGORITHMS;

EID: 54249106479     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-69903-3_30     Document Type: Conference Paper

References (18)

1. 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)
2. 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)
3. 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)
4. Blache, G., Karpinski, M., Wirtgen, J.: On approximation intractability of the bandwidth problem. Technical report TR98-014, University of Bonn (1997)
5. Brandstädt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey. SIAM Monog. Disc. Math. Appl. (1999)
6. Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs, 2nd edn. Ann. Disc. Math, vol. 57. Elsevier, Amsterdam (2004)
7. 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)
8. 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)
9. Indyk, P.: Algorithmic applications of low-distortion geometric embeddings. In: Proceedings of FOGS 2001, pp. 10-35. IEEE, Los Alamitos (2005)
10. 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)
11. 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)
12. Kleitman, D.J., Vohra, R.V.: Computing the bandwidth of interval graphs. SIAM J. Disc. Math. 3, 373-375 (1990)
13. Mahadev, N., Peled, U.: Threshold graphs and related topics. In: Ann. Disc. Math, vol. 56, North-Holland, Amsterdam (1995)
14. Monien, B.: The Bandwidth-Minimization Problem for Caterpillars with Hair Length 3 is NP-Complete. SIAM J. Alg. Disc. Meth. 7, 505-512 (1986)
15. 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)
16. Spinrad, J., Brandstädt, A., Stewart, L.: Bipartite permutation graphs. Disc. Appl. Math. 18, 279-292 (1987)
17. Sprague, A.P.: An O(n log n) algorithm for bandwidth of interval graphs. SIAM J. Disc. Math. 7, 213-220 (1994)
18. Tenenbaum, J.B., de Silva, V., Langford, J.C.: A global geometric framework for nonlinear dimensionality reduction. Science 290, 2319-2323 (2000)