Hardness and approximation of minimum distortion embeddings

Authors:
Pinar Heggernes;Daniel Meister
Affiliations:
Department of Informatics, University of Bergen, Norway;Department of Informatics, University of Bergen, Norway
Venue:
Information Processing Letters
Year:
2010

Citing 12
Cited 1

Computing the bandwidth of interval graphs

SIAM Journal on Discrete Mathematics
An optimal greedy heuristic to color interval graphs

Information Processing Letters
Domination on cocomparability graphs

SIAM Journal on Discrete Mathematics
An $0(n \log n)$ Algorithm for Bandwidth of Interval Graphs

SIAM Journal on Discrete Mathematics
Restrictions of minimum spanner problems

Information and Computation
Graph classes: a survey

Graph classes: a survey
Approximating the Bandwidth for Asteroidal Triple-Free Graphs

ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
Algorithmic Applications of Low-Distortion Geometric Embeddings

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
An NP-hard problem in bipartite graphs

ACM SIGACT News
Low distortion maps between point sets

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Approximation algorithms for low-distortion embeddings into low-dimensional spaces

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs

Discrete Applied Mathematics

Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs

Theoretical Computer Science

Quantified Score

Hi-index	0.89

Visualization

Abstract

We show that the problem of computing a minimum distortion embedding of a given graph into a path is NP-hard when the input graph is bipartite, cobipartite, or split. This problem is hard to approximate within a constant factor on arbitrary graphs. We give polynomial-time constant-factor approximation algorithms for split, cocomparability, interval and cographs.