Distortion is Fixed Parameter Tractable
From MaRDI portal
Publication:2947587
DOI10.1145/2489789zbMath1322.68102OpenAlexW2054702649WikidataQ57359610 ScholiaQ57359610MaRDI QIDQ2947587
Elena Losievskaja, Fedor V. Fomin, Saket Saurabh, Frances A. Rosamond, Michael R. Fellows, Daniel Lokshtanov
Publication date: 24 September 2015
Published in: ACM Transactions on Computation Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2489789
Analysis of algorithms and problem complexity (68Q25) Distance in graphs (05C12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Unnamed Item, Line-distortion, bandwidth and path-length of a graph, Slightly Superexponential Parameterized Problems, Unnamed Item, Unnamed Item, Decomposing a graph into shortest paths with bounded eccentricity, Approximation Algorithms for Low-Distortion Embeddings into Low-Dimensional Spaces
