Minimum Diameter Spanning Trees and Related Problems
From MaRDI portal
Recommendations
Cited in
(59)- Facility location and the geometric minimum-diameter spanning tree.
- Minimum restricted diameter spanning trees.
- The minimum labeling spanning trees
- Minimizing the diameter of a spanning tree for imprecise points
- Building bridges between convex regions
- Computing a (1+)-approximate geometric minimum-diameter spanning tree
- Minimum diameter color-spanning sets revisited
- Minimum diameter vertex-weighted Steiner tree
- A unifying model for locally constrained spanning tree problems
- Hardness and efficiency on minimizing maximum distances in spanning trees
- Minimal spanning trees and Stein's method
- The discrete and mixed minimax 2-center problems
- Minimum diameter cost-constrained Steiner trees
- Minimum spanning tree cycle intersection problem
- Random-tree diameter and the diameter-constrained MST
- A catalog of Hanan grid problems
- Memory-efficient enumeration of constrained spanning trees
- Minimax flow tree problems
- The minimum bounded-diameter spanning forest problem is log-approximable
- SINGLE-SOURCE DILATION-BOUNDED MINIMUM SPANNING TREES
- Minimizing the diameter of a spanning tree for imprecise points
- The discrete and mixed minimax 2-center problem
- scientific article; zbMATH DE number 5730481 (Why is no real title available?)
- Determining a Minimum Spanning Tree with Disjunctive Constraints
- Geometric minimum diameter minimum cost spanning tree problem
- Minimum Spanning Trees in k-Dimensional Space
- Bounded-degree minimum-radius spanning trees in wireless sensor networks
- Euclidean chains and their shortcuts
- scientific article; zbMATH DE number 91018 (Why is no real title available?)
- scientific article; zbMATH DE number 176576 (Why is no real title available?)
- scientific article; zbMATH DE number 540118 (Why is no real title available?)
- scientific article; zbMATH DE number 731844 (Why is no real title available?)
- scientific article; zbMATH DE number 1080078 (Why is no real title available?)
- scientific article; zbMATH DE number 1947054 (Why is no real title available?)
- scientific article; zbMATH DE number 1947056 (Why is no real title available?)
- scientific article; zbMATH DE number 1512690 (Why is no real title available?)
- Minimum-sum dipolar spanning tree in \(\mathbb R^3\)
- Random-tree Diameter and the Diameter-constrained MST
- Minimizing diameters of dynamic trees
- The saga of minimum spanning trees
- Modeling and solving the bi-objective minimum diameter-cost spanning tree problem
- Algorithms for the minimum diameter terminal Steiner tree problem
- Spanning trees with small diameters
- An exact method for solving the bi-objective minimum diameter-cost spanning tree problem
- Delay-constrained minimum shortest path trees and related problems
- Delay-constrained minimum shortest path trees and related problems
- 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
- Minimum weight clustered dominating tree problem
- On solving bi-objective constrained minimum spanning tree problems
- Piercing diametral disks induced by edges of maximum spanning trees
- On the minimum diameter spanning tree problem
- ``Minimax length links of a dissimilarity matrix and minimum spanning trees
- Finding ultrametric minimum-diameter spanning trees
- Carousel greedy algorithms for the minimum stretch spanning tree problem
- Parameterized approximations for the minimum diameter vertex-weighted Steiner tree problem in graphs with parameterized weights
- An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees
- Minimum cost spanning tree problems with groups
- Diameter-preserving spanning trees in sparse weighted graphs
This page was built for publication: Minimum Diameter Spanning Trees and Related Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3982716)
