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