The complexity of designing a network with minimum diameter
From MaRDI portal
Publication:3910007
DOI10.1002/net.3230110110zbMath0459.68028OpenAlexW2014154116MaRDI QIDQ3910007
Publication date: 1981
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230110110
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Related Items (12)
Light graphs with small routing cost ⋮ Maximal and minimal vertex-critical graphs of diameter two ⋮ Network design for time-constrained delivery using subgraphs ⋮ Reload cost problems: Minimum diameter spanning tree ⋮ Multicastad hocrouting through mobility-aware Steiner tree meshes with consistency across different mobility models ⋮ Improved approximability and non-approximability results for graph diameter decreasing problems ⋮ The non-approximability of bicriteria network design problems ⋮ Improving spanning trees by upgrading nodes ⋮ Combinatorial analysis (nonnegative matrices, algorithmic problems) ⋮ Exact approaches for the minimum subgraph diameter problem ⋮ Reducing the diameter of a unit disk graph via node addition ⋮ Placing Green bridges optimally, with a multivariate analysis
Cites Work
This page was built for publication: The complexity of designing a network with minimum diameter
