Improved Approximability and Non-approximability Results for Graph Diameter Decreasing Problems

DOI10.1007/978-3-642-15155-2_15zbMath1287.05146OpenAlexW1749313729MaRDI QIDQ3586080

Davide Bilò, Luciano Gualà, Guido Proietti

Publication date: 3 September 2010

Published in: Mathematical Foundations of Computer Science 2010 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15155-2_15

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

This page was built for publication: Improved Approximability and Non-approximability Results for Graph Diameter Decreasing Problems