Pages that link to "Item:Q1607061"
From MaRDI portal
The following pages link to A note on the MST heuristic for bounded edge-length Steiner trees with minimum number of Steiner points (Q1607061):
Displaying 12 items.
- Improved approximation algorithms for single-tiered relay placement (Q266064) (← links)
- Relay placement for fault tolerance in wireless networks in higher dimensions (Q632722) (← links)
- Wireless network design via 3-decompositions (Q990943) (← links)
- Algorithms for connected set cover problem and fault-tolerant connected set cover problem (Q1006053) (← links)
- An approximation algorithm for a bottleneck \(k\)-Steiner tree problem in the Euclidean plane (Q1603516) (← links)
- Approximating Steiner trees and forests with minimum number of Steiner points (Q1796259) (← links)
- Relay placement for two-connectivity (Q2339829) (← links)
- The subdivision-constrained routing requests problem (Q2436672) (← links)
- Combination algorithms for Steiner tree variants (Q2700384) (← links)
- Approximating Steiner Trees and Forests with Minimum Number of Steiner Points (Q3453286) (← links)
- (6 + ε)-Approximation for Minimum Weight Dominating Set in Unit Disk Graphs (Q3511366) (← links)
- Constructing minimal spanning/Steiner trees with bounded path length (Q4397100) (← links)
