Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

IPL
2010

favoriteEmaildiscussreport

115views more IPL 2010»

Hardness and approximation of minimum distortion embeddings

13 years 3 months ago

Hardness and approximation of minimum distortion embeddings

Download www.ii.uib.no

We show that the problem of computing a minimum distortion embedding of a given graph into a path remains NP-hard when the input graph is restricted to a bipartite, cobipartite, or split graph. This implies the NP-hardness of the problem also on chordal, cocomparability, and AT-free graphs. This problem is hard to approximate within a constant factor on arbitrary graphs. We give polynomial-time constant-factor approximation algorithms for split and cocomparability graphs. We conclude with some upper bounds for interval graphs and cographs, on which the computational complexity of the problem is open.

Pinar Heggernes, Daniel Meister

Real-time Traffic

Arbitrary Graphs | AT-free Graphs | IPL 2010 | Polynomial-time Constant-factor Approximation |

claim paper

Related Content

» Hardness of Embedding Metric Spaces of Equal Size

» Lowdistortion embeddings of general metrics into the line

» Embedding ultrametrics into lowdimensional spaces

» Computing minimum distortion embeddings into a path for bipartite permutation graphs and t...

» On Euclidean Embeddings and Bandwidth Minimization

» A Framework for Linear Transform Approximation Using Orthogonal Basis Projection

» LCS Approximation via Embedding into Local Nonrepetitive Strings

» Plane embeddings of planar graph metrics

» Circular partitions with applications to visualization and embeddings

Post Info
More Details (n/a)

Added	28 Jan 2011
Updated	28 Jan 2011
Type	Journal
Year	2010
Where	IPL
Authors	Pinar Heggernes, Daniel Meister

Comments (0)