Pages that link to "Item:Q673823"

The following pages link to On the minimum diameter spanning tree problem (Q673823):

Displaying 49 items.

• Bounded-degree minimum-radius spanning trees in wireless sensor networks (Q391199) (← links)
• Cooperative location games based on the minimum diameter spanning Steiner subgraph problem (Q423895) (← 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)
• Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree (Q729821) (← links)
• Network search games with immobile hider, without a designated searcher starting point (Q933761) (← links)
• Combinatorial network abstraction by trees and distances (Q954979) (← links)
• Minimum cost spanning tree problems with groups (Q964464) (← links)
• Minimum cut bases in undirected networks (Q968141) (← links)
• Diameter-preserving spanning trees in sparse weighted graphs (Q968216) (← links)
• Strongly polynomial-time truthful mechanisms in one shot (Q1014632) (← links)
• Facility location and the geometric minimum-diameter spanning tree. (Q1421033) (← links)
• Minimum restricted diameter spanning trees. (Q1427810) (← links)
• The non-approximability of bicriteria network design problems (Q1827279) (← links)
• Computing a \((1+\varepsilon)\)-approximate geometric minimum-diameter spanning tree (Q1879253) (← links)
• A distributed algorithm for constructing a minimum diameter spanning tree (Q1881298) (← 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 for graphs with few \(P_4\)'s and \((k, \ell)\)-graphs (Q2132367) (← links)
• A sifting-edges algorithm for accelerating the computation of absolute 1-center in graphs (Q2165256) (← links)
• Hardness and efficiency on minimizing maximum distances in spanning trees (Q2197544) (← links)
• A 2-approximation algorithm and beyond for the minimum diameter \(k\)-Steiner forest problem (Q2201993) (← links)
• Hardness and efficiency on \(t\)-admissibility for graph operations (Q2231778) (← links)
• A cooperative location game based on the 1-center location problem (Q2275823) (← links)
• Minimum diameter cost-constrained Steiner trees (Q2436659) (← links)
• The zoo of tree spanner problems (Q2476246) (← links)
• Optimality computation of the minimum stretch spanning tree problem (Q2656713) (← links)
• Minimum spanning tree cycle intersection problem (Q2656964) (← links)
• Minimax flow tree problems (Q3057112) (← links)
• Network search games, with arbitrary searcher starting point (Q3184600) (← links)
• THE MINIMUM SPANNING TREE PROBLEM: Jarník's solution in historical and present context (Q3439600) (← links)
• A 2k-vertex Kernel for Maximum Internal Spanning Tree (Q3449846) (← links)
• (Q3574996) (← links)
• On the Red/Blue Spanning Tree Problem (Q3630196) (← links)
• Determining a Minimum Spanning Tree with Disjunctive Constraints (Q3645334) (← links)
• Minimum Diameter Spanning Trees and Related Problems (Q3982716) (← links)
• Light graphs with small routing cost (Q4537619) (← links)
• Minimizing diameters of dynamic trees (Q4571959) (← links)
• The Center Colorıng of a Graph (Q5069729) (← links)
• Spanning trees with small diameters (Q5154596) (← links)
• Online Minimum Spanning Tree with Advice (Q5895056) (← links)
• Delay-constrained minimum shortest path trees and related problems (Q5918729) (← links)
• Delay-constrained minimum shortest path trees and related problems (Q5925589) (← links)
• Reload cost problems: Minimum diameter spanning tree (Q5948962) (← links)
• Reconfiguration of spanning trees with degree constraints or diameter constraints (Q6053473) (← links)
• The minimum centroid branch spanning tree problem (Q6566796) (← links)
• Approximate envy-freeness in graphical cake cutting (Q6611013) (← links)