Pages that link to "Item:Q2488210"
From MaRDI portal
The following pages link to Approximating \(k\)-hop minimum-spanning trees (Q2488210):
Displaying 21 items.
- Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem (Q342101) (← links)
- A cost allocation rule for \(k\)-hop minimum cost spanning tree problems (Q433843) (← links)
- A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks (Q452816) (← links)
- Strong minimum energy \(2\)-hop rooted topology for hierarchical wireless sensor networks (Q887852) (← links)
- A linear time algorithm for optimal \(k\)-hop dominating set of a tree (Q894482) (← links)
- Approximating \(k\)-hop minimum spanning trees in Euclidean metrics (Q963410) (← links)
- Low-light trees, and tight lower bounds for Euclidean spanners (Q972609) (← links)
- Approximate hierarchical facility location and applications to the bounded depth Steiner tree and range assignment problems (Q1026247) (← links)
- The computational complexity of the \(k\)-minimum spanning tree problem in graded matrices (Q1806599) (← links)
- Finding bounded diameter minimum spanning tree in general graphs (Q2147109) (← links)
- Time complexity analysis of evolutionary algorithms for 2-hop \((1,2)\)-minimum spanning tree problem (Q2238214) (← links)
- On the bounded-hop MST problem on random Euclidean instances (Q2382669) (← links)
- A new rule for source connection problems (Q2514781) (← links)
- Minimax flow tree problems (Q3057112) (← links)
- SINGLE-SOURCE DILATION-BOUNDED MINIMUM SPANNING TREES (Q3459364) (← links)
- Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Directed Network Design Problems (Q5085153) (← links)
- Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics (Q5089179) (← links)
- Approximation algorithms for somek-source shortest paths spanning tree problems (Q5471085) (← links)
- Network design for time‐constrained delivery (Q5503760) (← links)
- Structural Information and Communication Complexity (Q5710099) (← links)
- On Hop-Constrained Steiner Trees in Tree-Like Metrics (Q5864216) (← links)
