Bounded-diameter minimum-cost graph problems
From MaRDI portal
Publication:2464340
DOI10.1007/s00224-006-1305-zzbMath1148.68040OpenAlexW2084822306MaRDI QIDQ2464340
Mohammad Sarwat, Sanjiv Kapoor
Publication date: 19 December 2007
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-006-1305-z
Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (8)
Fast Algorithms for Diameter-Optimally Augmenting Paths ⋮ Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees ⋮ Augmenting graphs to minimize the diameter ⋮ Shortcuts for the circle ⋮ Delay-constrained minimum shortest path trees and related problems ⋮ Improved approximability and non-approximability results for graph diameter decreasing problems ⋮ Unnamed Item ⋮ When diameter matters: parameterized approximation algorithms for bounded diameter minimum Steiner tree problem
This page was built for publication: Bounded-diameter minimum-cost graph problems
