Pages that link to "Item:Q1763151"
From MaRDI portal
The following pages link to Approximating the degree-bounded minimum diameter spanning tree problem (Q1763151):
Displaying 22 items.
- Bounded-degree minimum-radius spanning trees in wireless sensor networks (Q391199) (← links)
- Modeling and solving the bi-objective minimum diameter-cost spanning tree problem (Q486390) (← links)
- Degree-bounded minimum spanning tree for unit disk graph (Q764345) (← links)
- Cooperative TSP (Q982655) (← links)
- Degree-bounded minimum spanning trees (Q1028423) (← links)
- Primal dual based algorithm for degree-balanced spanning tree problem (Q1740242) (← links)
- Near-optimal bounded-degree spanning trees (Q1840509) (← links)
- Approximating minimum-cost graph problems with spanning tree edges (Q1892100) (← links)
- The non-uniform bounded degree minimum diameter spanning tree problem with an application in P2P networking (Q1941696) (← links)
- A unifying model for locally constrained spanning tree problems (Q2045044) (← links)
- Finding bounded diameter minimum spanning tree in general graphs (Q2147109) (← links)
- Broadcasting a file in a communication network (Q2173055) (← links)
- Hardness and efficiency on minimizing maximum distances in spanning trees (Q2197544) (← links)
- Bounded-degree light approximate shortest-path trees in doubling metrics (Q2235274) (← links)
- An \(O(1)\)-approximation algorithm for the 2-dimensional geometric freeze-tag problem (Q2345867) (← links)
- The maximum degree \& diameter-bounded subgraph and its applications (Q2392540) (← links)
- New Heuristic Approaches for the Bounded-Diameter Minimum Spanning Tree Problem (Q2942691) (← links)
- Probabilistic analysis of an algorithm for the minimum spanning tree problem with diameter bounded below (Q3186835) (← links)
- SINGLE-SOURCE DILATION-BOUNDED MINIMUM SPANNING TREES (Q3459364) (← links)
- (Q4286079) (← links)
- (Q4448919) (← links)
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques (Q5900926) (← links)