Abstract
We study low-distortion embedding of metric spaces into the line, and more generally, into the shortest path metric of trees, from the parameterized complexity perspective. Let M = M(G) be the shortest path metric of an edge-weighted graph G, with the vertex set V(G) and the edge set E(G), on n vertices. We give the first fixed parameter tractable algorithm that for an unweighted graph metric M and integer d either constructs an embedding of M into the line with distortion at most d, or concludes that no such embedding exists. Our algorithm requires O(nd4(2d + 1)2d) time which is a significant improvement over the best previous algorithm that runs in time O(n4d+2dO(1)). Because of its apparent similarity to the notoriously hard Bandwidth Minimization problem, we find it surprising that this problem turns out to be fixed parameter tractable.
We extend our results on embedding unweighted graph metric into the line in two ways. First, we give an algorithm to construct small-distortion embeddings of weighted graph metrics. The running time of our algorithm is O(n(dW)4(2d + 1)2dW), where W is the largest edge weight of the input graph. To complement this result, we show that the exponential dependence on the maximum edge weight is unavoidable. In particular, we show that deciding whether a weighted graph metric M(G) with maximum weight W < |V(G)| can be embedded into the line with distortion at most d is NP-complete for every fixed rational d ≥ 2. This rules out any possibility of an algorithm with running time O((nW)h(d)) where h is a function of d alone. Second, we consider more general host metrics for which analogous results hold. In particular, we prove that for any tree T with maximum degree Δ, embedding M into a shortest path metric of T is fixed parameter tractable, parameterized by (Δ, d).
- Mihai Bădoiu, Julia Chuzhoy, Piotr Indyk, and Anastasios Sidiropoulos. 2005a. Low-distortion embeddings of general metrics into the line. In Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC’05). ACM Press, New York, 225--233. Google Scholar
Digital Library
- Mihai Bădoiu, Kedar Dhamdhere, Anupam Gupta, Yuri Rabinovich, Harald Räcke, R. Ravi, and Anastasios Sidiropoulos. 2005b. Approximation algorithms for low-distortion embeddings into low-dimensional spaces. In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’05). 119--128. Google Scholar
Digital Library
- Mihai Bădoiu, Piotr Indyk, and Anastasios Sidiropoulos. 2007. Approximation algorithms for embedding general metrics into trees. In Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’07). 512--521. Google Scholar
Digital Library
- Hans L. Bodlaender, Michael R. Fellows, and Michael T. Hallett. 1994. Beyond np-completeness for problems of bounded width: Hardness for the w hierarchy (extended abstract). In Proceedings of the ACM Symposium on Theory of Computing. 449--458. Google Scholar
Digital Library
- Hans L. Bodlaender, Michael R. Fellows, Michael T. Hallett, Todd Wareham, and Tandy Warnow. 2000. The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs. Theor. Comput. Sci. 244, 1--2, 167--188. Google Scholar
Digital Library
- Rodney G. Downey and Michael R. Fellows. 1999. Parameterized Complexity. Springer. Google Scholar
Digital Library
- Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Elena Losievskaja, Frances A. Rosamond, and Saket Saurabh. 2009. Distortion is fixed parameter tractable. In Proceedings of the 36th International Colloquium on Automata, Languages and Programming (ICALP’09). Lecture Notes in Computer Science, vol. 5555, Springer, 463--474. Google Scholar
Digital Library
- Jörg Flum and Martin Grohe. 2006. Parameterized Complexity Theory. Springer. Google Scholar
Digital Library
- Anupam Gupta, Ilan Newman, Yuri Rabinovich, and Alistair Sinclair. 2004. Cuts, trees and l1-embeddings of graphs. Combinatorica 24, 2, 233--269. Google Scholar
Digital Library
- Alexander Hall and Christos H. Papadimitriou. 2005. Approximating the distortion. In Proceedings of the 8th International Workshop Approximation, Randomization and Combinatorial Optimization, Algorithms and Techniques (APPROX-RANDOM’05). Lecture Notes in Computer Science, vol. 3624, Springer, 111--122. Google Scholar
Digital Library
- Piotr Indyk. 2001. Algorithmic applications of low-distortion geometric embeddings. In Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science (FOCS’01). 10--33. Google Scholar
Digital Library
- Claire Kenyon, Yuval Rabani, and Alistair Sinclair. 2004. Low distortion maps between point sets. In Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC’04). ACM Press, New York, 272--280. Google Scholar
Digital Library
- Nathan Linial. 2002. Finite metric-spaces---Combinatorics, geometry and algorithms. In Proceedings of the International Congress of Mathematicians. Vol. 3, Higher Education Press, 573--586.Google Scholar
- Daniel Lokshtanov, Dániel Marx, and Saket Saurabh. 2011. Slightly superexponential parameterized problems. In Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’11). 760--776. Google Scholar
Digital Library
- Rolf Niedermeier. 2006. Invitation to Fixed-Parameter Algorithms. Oxford Lecture Series in Mathematics and its Applications, vol. 31, Oxford University Press.Google Scholar
- James B. Saxe. 1980. Dynamic programming algorithms for recognizing small bandwidth graphs in polynomial time. SIAM J. Algebraic Discr. Methods 1, 4, 363--369.Google Scholar
Cross Ref
Index Terms
Distortion is Fixed Parameter Tractable
Recommendations
Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable
Given a graph G and an integer k, the Feedback Vertex Set (FVS) problem asks if there is a vertex set T of size at most k that hits all cycles in the graph. The first fixed-parameter algorithm for FVS in undirected graphs appeared in a monograph of ...
Distortion Is Fixed Parameter Tractable
ICALP '09: Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part IWe study low-distortion embedding of metric spaces into the line, and more generally, into the shortest path metric of trees, from the parameterized complexity perspective. Let M = M ( G ) be the shortest path metric of an edge weighted graph G ...
Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth
FOCS '14: Proceedings of the 2014 IEEE 55th Annual Symposium on Foundations of Computer ScienceWe give a fixed-parameter tractable algorithm that, given a parameter k and two graphs G1, G2, either concludes that one of these graphs has treewidth at least k, or determines whether G1 and G2 are isomorphic. The running time of the algorithm on an n-...






Comments