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

@article{Heggernes2011ComputingMD,
  title={Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs},
  author={Pinar Heggernes and Daniel Meister and Andrzej Proskurowski},
  journal={Theor. Comput. Sci.},
  year={2011},
  volume={412},
  pages={1275-1297}
}
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… CONTINUE READING

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-2 of 2 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 28 references

Distortion Is Fixed Parameter Tractable

  • P. Tanenbaum P. Fishburn, A. Trenk
  • ICALP
  • 2009

Approximation algorithms for embedding general metrics into trees

  • P. Indyk Bădoiu, A. Sidiropoulos
  • 2007

Matousek . Lowdistortion embeddings of finite metric spaces

  • Y. Rabani C. Kenyon, A. Sinclair
  • Handbook of Discrete and Computational Geometry
  • 2004

Similar Papers

Loading similar papers…