scientific article; zbMATH DE number 7236425
DOI10.4230/LIPIcs.SoCG.2018.21zbMath1489.68345arXiv1712.06747MaRDI QIDQ5115789
Fedor V. Fomin, Timothy Carpenter, Saket Saurabh, Daniel Lokshtanov, Anastasios Sidiropoulos
Publication date: 18 August 2020
Full work available at URL: https://arxiv.org/abs/1712.06747
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
approximation algorithmsmetric embeddingsfixed-parameter tractable algorithms1-dimensional simplicial complexminimum-distortion embeddings
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distance in graphs (05C12) Approximation algorithms (68W25) Parameterized complexity, tractability and kernelization (68Q27) Metric embeddings as related to computational problems and algorithms (68R12)
Related Items (3)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The geometry of graphs and some of its algorithmic applications
- Distortion is Fixed Parameter Tractable
- Fat polygonal partitions with applications to visualization and embeddings
- Inapproximability for metric embeddings into $\mathbb{R}^{d}$
- Stable distributions, pseudorandom generators, embeddings, and data stream computation
- Low distortion maps between point sets
- Low-distortion embeddings of general metrics into the line
- Low Distortion Maps Between Point Sets
- Hardness of Embedding Metric Spaces of Equal Size
- Distortion Is Fixed Parameter Tractable
- A Treehouse with Custom Windows: Minimum Distortion Embeddings into Bounded Treewidth Graphs
- Improved algorithms for optimal embeddings
- A robust model for finding optimal evolutionary trees
- Euclidean distortion and the sparsest cut
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Expander flows, geometric embeddings and graph partitioning
This page was built for publication:
