Minimum Diameter Spanning Trees and Related Problems
From MaRDI portal
Publication:3982716
DOI10.1137/0220060zbMath0749.68042OpenAlexW1985149601MaRDI QIDQ3982716
No author found.
Publication date: 26 June 1992
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0220060
NP-complete problemscomputational geometryminimum enclosing circleminimum diameter spanning treegeometric Steiner trees
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Related Items (27)
Building bridges between convex regions ⋮ Computing a \((1+\varepsilon)\)-approximate geometric minimum-diameter spanning tree ⋮ Memory-efficient enumeration of constrained spanning trees ⋮ The Discrete and Mixed Minimax 2-Center Problem ⋮ Bounded-degree minimum-radius spanning trees in wireless sensor networks ⋮ Euclidean chains and their shortcuts ⋮ Multicast routing under quality of service constraints for vehicular ad hoc networks: mathematical formulation and a relax‐and‐fix heuristic ⋮ A uniform self-stabilizing minimum diameter spanning tree algorithm ⋮ The discrete and mixed minimax 2-center problems ⋮ On solving bi-objective constrained minimum spanning tree problems ⋮ Minimum diameter cost-constrained Steiner trees ⋮ Minimizing the diameter of a spanning tree for imprecise points ⋮ Facility location and the geometric minimum-diameter spanning tree. ⋮ Minimum-sum dipolar spanning tree in \(\mathbb R^3\) ⋮ Modeling and solving the bi-objective minimum diameter-cost spanning tree problem ⋮ Algorithms for the minimum diameter terminal Steiner tree problem ⋮ On the minimum diameter spanning tree problem ⋮ A catalog of Hanan grid problems ⋮ Diameter-preserving spanning trees in sparse weighted graphs ⋮ Minimum diameter color-spanning sets revisited ⋮ Minimax flow tree problems ⋮ Minimum diameter vertex-weighted Steiner tree ⋮ A unifying model for locally constrained spanning tree problems ⋮ Delay-constrained minimum shortest path trees and related problems ⋮ Delay-constrained minimum shortest path trees and related problems ⋮ The minimum labeling spanning trees ⋮ An exact method for solving the bi-objective Minimum Diameter-Cost Spanning Tree Problem
This page was built for publication: Minimum Diameter Spanning Trees and Related Problems
