An exact algorithm for minimum distortion embedding
From MaRDI portal
Publication:551173
DOI10.1016/j.tcs.2011.02.043zbMath1257.68080DBLPjournals/tcs/FominLS11OpenAlexW2160237261WikidataQ60488539 ScholiaQ60488539MaRDI QIDQ551173
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh
Publication date: 14 July 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.02.043
Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (5)
On the Minimum Eccentricity Shortest Path Problem ⋮ On the minimum eccentricity shortest path problem ⋮ Bandwidth and distortion revisited ⋮ Line-distortion, bandwidth and path-length of a graph ⋮ Slightly Superexponential Parameterized Problems
Cites Work
- Bandwidth and distortion revisited
- Exact exponential algorithms.
- Cuts, trees and \(\ell_1\)-embeddings of graphs
- Exact and approximate bandwidth
- Low distortion maps between point sets
- Low-distortion embeddings of general metrics into the line
- Distortion Is Fixed Parameter Tractable
- Faster Exact Bandwidth
- An Exact Algorithm for Minimum Distortion Embedding
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: An exact algorithm for minimum distortion embedding
