Augmenting trees to meet biconnectivity and diameter constraints
From MaRDI portal
Publication:1601019
DOI10.1007/S00453-001-0113-8zbMATH Open1052.68099OpenAlexW2143091044MaRDI QIDQ1601019FDOQ1601019
Authors: Victor Chepoi, Yann Vaxès 
Publication date: 17 June 2002
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-001-0113-8
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Cited In (25)
- Optimizing budget allocation for center and median points
- Fast algorithms for diameter-optimally augmenting paths
- The parametric complexity of graph diameter augmentation
- Vertex fusion under diameter constraints
- Algorithms and Computation
- Augmenting outerplanar graphs to meet diameter requirements
- Fast algorithms for diameter-optimally augmenting paths and trees
- Algorithms for diameters of unicycle graphs and diameter-optimally augmenting trees
- Almost optimal algorithms for diameter-optimally augmenting trees
- Finding diameter-reducing shortcuts in trees
- Mathematical programming models for some smallest-world problems
- Minimizing the continuous diameter when augmenting a tree with a shortcut
- Mixed covering of trees and the augmentation problem with odd diameter constraints
- Title not available (Why is that?)
- Mixed covering of trees and the augmentation problem with odd diameter constraints
- Minimizing the continuous diameter when augmenting a geometric tree with a shortcut
- Vertex fusion under distance constraints
- Augmenting forests to meet odd diameter requirements
- On the Hardness and Approximability of Planar Biconnectivity Augmentation
- Augmenting graphs to minimize the diameter
- Almost optimal algorithms for diameter-optimally augmenting trees
- Improved approximability and non-approximability results for graph diameter decreasing problems
- Augmenting graphs to minimize the radius
- Approximation algorithms for forests augmentation ensuring two disjoint paths of bounded length
- On the characterization of the domination of a diameter-constrained network reliability model
This page was built for publication: Augmenting trees to meet biconnectivity and diameter constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1601019)
