Minimizing the Continuous Diameter when Augmenting Paths and Cycles with Shortcuts
From MaRDI portal
Publication:5369503
DOI10.4230/LIPIcs.SWAT.2016.1zbMath1378.68195OpenAlexW2195699850MaRDI QIDQ5369503
Zachary Friggstad, Mohsen Rezapour, Mohammad R. Salavatipour
Publication date: 17 October 2017
Full work available at URL: http://dx.doi.org/10.4230/LIPIcs.SWAT.2016.1
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Discrete location and assignment (90B80) Approximation algorithms (68W25)
Related Items (4)
On colorful vertex and edge cover problems ⋮ Improved bounds for metric capacitated covering problems ⋮ Unnamed Item ⋮ Respecting lower bounds in uniform lower and upper bounded facility location problem
This page was built for publication: Minimizing the Continuous Diameter when Augmenting Paths and Cycles with Shortcuts
