Multivariate exploration of metric dilation

DOI10.4230/LIPICS.STACS.2025.14MaRDI QIDQ7287745zbMATH OpenFDO

Authors Aritra Banik, Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Satyabrata Jana, Saket Saurabh

Publication date 24 June 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.STACS.2025.14

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• An FPT Algorithm for Minimum Additive Spanner Problem.
• Computing Best and Worst Shortcuts of Graphs Embedded in Metric Spaces
• Computing geometric minimum-dilation graphs is NP-hard
• Computing the dilation of edge-augmented graphs in metric spaces
• Geometric Spanner Networks
• Graph spanners
• scientific article; zbMATH DE number 1518742 (Why is no real title available?)
• scientific article; zbMATH DE number 7650282 (Why is no real title available?)
• Improving the Dilation of a Metric Graph by Adding Edges
• Improving the Stretch Factor of a Geometric Network by Edge Augmentation
• NP-hardness and fixed-parameter tractability of the minimum spanner problem
• ON SPANNERS OF GEOMETRIC GRAPHS
• On the parameterized complexity of multiple-interval graph problems
• Parameterized algorithms
• Parametrized complexity theory.
• Paths, Trees, and Flowers
• Sparse geometric graphs with small dilation
• The parametric complexity of graph diameter augmentation

This page was built for publication: Multivariate exploration of metric dilation

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