Mixed covering of trees and the augmentation problem with odd diameter constraints
From MaRDI portal
Publication:5899375
DOI10.1016/j.endm.2005.06.068zbMath1200.05053MaRDI QIDQ5899375
Karim Nouioua, Victor Chepoi, Bertrand Estellon, Yann Vaxès
Publication date: 29 May 2007
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.594.8708
05C05: Trees
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C12: Distance in graphs
Related Items
Cites Work
- On the minimum-cardinality-bounded-diameter and the bounded-cardinality- minimum-diameter edge addition problems
- Augmenting trees to meet biconnectivity and diameter constraints
- Design networks with bounded pairwise distance
- The Maximum Coverage Location Problem
- Diameter increase caused by edge deletion
- Algorithms and Computation
- Mixed covering of trees and the augmentation problem with odd diameter constraints