Mixed covering of trees and the augmentation problem with odd diameter constraints

DOI10.1016/J.ENDM.2005.06.068MaRDI QIDQ5899375zbMATH OpenOpenAlexFDO

Authors Victor Chepoi, Bertrand Estellon, Karim Nouioua, 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

zbMATH Keywords

approximation algorithmsdiameterdynamical programmingaugmentation problempartial covering

Mathematics Subject Classification ID

Trees (05C05) Distance in graphs (05C12) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites work

• Algorithms and Computation
• Augmenting trees to meet biconnectivity and diameter constraints
• Design networks with bounded pairwise distance
• Diameter increase caused by edge deletion
• Mixed covering of trees and the augmentation problem with odd diameter constraints
• On the minimum-cardinality-bounded-diameter and the bounded-cardinality- minimum-diameter edge addition problems
• The Maximum Coverage Location Problem

Cited in

(1)

• Mixed covering of trees and the augmentation problem with odd diameter constraints

This page was built for publication: Mixed covering of trees and the augmentation problem with odd diameter constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5899375)