Augmenting forests to meet odd diameter requirements
From MaRDI portal
Publication:2506822
DOI10.1016/j.disopt.2005.10.006zbMath1101.90078OpenAlexW2150008165MaRDI QIDQ2506822
Shigeyuki Yamamoto, Toshimasa Ishii, Hiroshi Nagamochi
Publication date: 10 October 2006
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2005.10.006
Programming involving graphs or networks (90C35) Communication networks in operations research (90B18) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (6)
On coloring the arcs of a tournament, covering shortest paths, and reducing the diameter of a graph ⋮ Approximation algorithms for forests augmentation ensuring two disjoint paths of bounded length ⋮ Improved approximability and non-approximability results for graph diameter decreasing problems ⋮ Complexity and algorithms for constant diameter augmentation problems ⋮ Vertex fusion under distance constraints ⋮ Augmenting Outerplanar Graphs to Meet Diameter Requirements
Cites Work
- Graph connectivity and its augmentation: Applications of MA orderings
- Edge-connectivity augmentation problems
- On the minimum-cardinality-bounded-diameter and the bounded-cardinality- minimum-diameter edge addition problems
- How to decrease the diameter of triangle-free graphs
- Augmenting trees to meet biconnectivity and diameter constraints
- Design networks with bounded pairwise distance
- Diameter increase caused by edge deletion
- Location on Tree Networks: P-Centre and n-Dispersion Problems
- Augmentation Problems
- Dually Chordal Graphs
- Decreasing the diameter of bounded degree graphs
- Depth-First Search and Linear Graph Algorithms
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Augmenting forests to meet odd diameter requirements
