scientific article; zbMATH DE number 7236425

DOI10.4230/LIPICS.SOCG.2018.21zbMATH Open1489.68345arXiv1712.06747MaRDI QIDQ5115789FDOQ5115789

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 of this publication is not available (Why is that?)

zbMATH Keywords

approximation algorithmsmetric embeddingsfixed-parameter tractable algorithms1-dimensional simplicial complexminimum-distortion embeddings

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Distance in graphs (05C12) Parameterized complexity, tractability and kernelization (68Q27) Metric embeddings as related to computational problems and algorithms (68R12)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The geometry of graphs and some of its algorithmic applications
• Expander flows, geometric embeddings and graph partitioning
• The complexity of low-distortion embeddings between point sets
• Stable distributions, pseudorandom generators, embeddings, and data stream computation
• Euclidean distortion and the sparsest cut
• Approximation algorithms for low-distortion embeddings into low-dimensional spaces
• Distortion Is Fixed Parameter Tractable
• Low-distortion embeddings of general metrics into the line
• Distortion is Fixed Parameter Tractable
• Hardness of Embedding Metric Spaces of Equal Size
• Low distortion maps between point sets
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
• Low Distortion Maps Between Point Sets
• Improved algorithms for optimal embeddings
• Fat polygonal partitions with applications to visualization and embeddings
• Inapproximability for metric embeddings into $\mathbb{R}^{d}$
• A robust model for finding optimal evolutionary trees
• A Treehouse with Custom Windows: Minimum Distortion Embeddings into Bounded Treewidth Graphs

Cited In (6)

• Bypassing the embedding
• Random embeddings with an almost Gaussian distortion
• Title not available (Why is that?)
• Title not available (Why is that?)
• Approximation algorithms for low-distortion embeddings into low-dimensional spaces
• Light Euclidean Spanners with Steiner Points

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5115789)