Pages that link to "Item:Q3982716"

The following pages link to Minimum Diameter Spanning Trees and Related Problems (Q3982716):

Displaying 47 items.

• Memory-efficient enumeration of constrained spanning trees (Q294700) (← links)
• Bounded-degree minimum-radius spanning trees in wireless sensor networks (Q391199) (← links)
• Euclidean chains and their shortcuts (Q391221) (← links)
• Minimum-sum dipolar spanning tree in \(\mathbb R^3\) (Q452446) (← links)
• The saga of minimum spanning trees (Q458468) (← links)
• Modeling and solving the bi-objective minimum diameter-cost spanning tree problem (Q486390) (← links)
• Algorithms for the minimum diameter terminal Steiner tree problem (Q489734) (← links)
• On the minimum diameter spanning tree problem (Q673823) (← links)
• ``Minimax length links'' of a dissimilarity matrix and minimum spanning trees (Q676486) (← links)
• An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees (Q863567) (← links)
• Minimum cost spanning tree problems with groups (Q964464) (← links)
• Diameter-preserving spanning trees in sparse weighted graphs (Q968216) (← links)
• Facility location and the geometric minimum-diameter spanning tree. (Q1421033) (← links)
• Minimum restricted diameter spanning trees. (Q1427810) (← links)
• The minimum labeling spanning trees (Q1567492) (← links)
• Minimizing the diameter of a spanning tree for imprecise points (Q1709600) (← links)
• Building bridges between convex regions (Q1873160) (← links)
• Computing a \((1+\varepsilon)\)-approximate geometric minimum-diameter spanning tree (Q1879253) (← links)
• Minimum diameter color-spanning sets revisited (Q2010932) (← links)
• Minimum diameter vertex-weighted Steiner tree (Q2039644) (← links)
• A unifying model for locally constrained spanning tree problems (Q2045044) (← links)
• Hardness and efficiency on minimizing maximum distances in spanning trees (Q2197544) (← links)
• Minimal spanning trees and Stein's method (Q2403137) (← links)
• The discrete and mixed minimax 2-center problems (Q2424880) (← links)
• Minimum diameter cost-constrained Steiner trees (Q2436659) (← links)
• Minimum spanning tree cycle intersection problem (Q2656964) (← links)
• Random-tree diameter and the diameter-constrained MST (Q2718345) (← links)
• A catalog of Hanan grid problems (Q2748382) (← links)
• Minimax flow tree problems (Q3057112) (← links)
• SINGLE-SOURCE DILATION-BOUNDED MINIMUM SPANNING TREES (Q3459364) (← links)
• The Discrete and Mixed Minimax 2-Center Problem (Q3467837) (← links)
• (Q3574996) (← links)
• Determining a Minimum Spanning Tree with Disjunctive Constraints (Q3645334) (← links)
• Minimum Spanning Trees in <i>k</i>-Dimensional Space (Q3798263) (← links)
• (Q4286079) (← links)
• (Q4361564) (← links)
• (Q4508378) (← links)
• Random-tree Diameter and the Diameter-constrained MST (Q4551459) (← links)
• Minimizing diameters of dynamic trees (Q4571959) (← links)
• Spanning trees with small diameters (Q5154596) (← links)
• An exact method for solving the bi-objective Minimum Diameter-Cost Spanning Tree Problem (Q5247677) (← links)
• Delay-constrained minimum shortest path trees and related problems (Q5918729) (← links)
• Delay-constrained minimum shortest path trees and related problems (Q5925589) (← links)
• Multicast routing under quality of service constraints for vehicular ad hoc networks: mathematical formulation and a relax‐and‐fix heuristic (Q6066592) (← links)
• A uniform self-stabilizing minimum diameter spanning tree algorithm (Q6084561) (← links)
• Minimum weight clustered dominating tree problem (Q6109249) (← links)
• On solving bi-objective constrained minimum spanning tree problems (Q6166107) (← links)