Mixed covering of trees and the augmentation problem with odd diameter constraints
From MaRDI portal
Publication:5920611
DOI10.1007/s00453-005-1183-9zbMath1095.68129OpenAlexW2114844711MaRDI QIDQ5920611
Karim Nouioua, Yann Vaxès, Victor Chepoi, Bertrand Estellon
Publication date: 11 August 2006
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.594.8708
Dynamic programming (90C39) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (8)
A Polynomial-Time Algorithm for Outerplanar Diameter Improvement ⋮ A polynomial-time algorithm for outerplanar diameter improvement ⋮ Vertex fusion under diameter constraints ⋮ Approximation algorithms for forests augmentation ensuring two disjoint paths of bounded length ⋮ An \(O(n(\log n)^{2}/\log \log n)\) algorithm for the single maximum coverage location or the \((1,X_p)\)-medianoid problem on trees ⋮ Improved approximability and non-approximability results for graph diameter decreasing problems ⋮ Vertex fusion under distance constraints ⋮ Augmenting Outerplanar Graphs to Meet Diameter Requirements
This page was built for publication: Mixed covering of trees and the augmentation problem with odd diameter constraints
