The following pages link to (Q3128917):
Displaying 16 items.
- Shape rectangularization problems in intensity-modulated radiation therapy (Q534786) (← links)
- An O\((\log k)\)-approximation algorithm for the \(k\) minimum spanning tree problem in the plane (Q679454) (← links)
- Low-light trees, and tight lower bounds for Euclidean spanners (Q972609) (← links)
- Approximating the weight of shallow Steiner trees (Q1296580) (← links)
- A constant-factor approximation algorithm for the \(k\)-MST problem (Q1305925) (← links)
- \(k\)-edge subgraph problems (Q1356515) (← links)
- Faster geometric \(k\)-point MST approximation (Q1370933) (← links)
- On the approximability of some Maximum Spanning Tree Problems (Q1391300) (← links)
- Improved Steiner tree algorithms for bounded treewidth (Q1932355) (← links)
- A new approximation algorithm for the selective single-sink buy-at-bulk problem in network design (Q2015804) (← links)
- Solving energy issues for sweep coverage in wireless sensor networks (Q2357168) (← links)
- Balls and Funnels: Energy Efficient Group-to-Group Anycasts (Q2817865) (← links)
- Bicriteria Network Design Problems (Q4216149) (← links)
- Service-constrained network design problems (Q5054805) (← links)
- On the approximability of some maximum spanning tree problems (Q5096340) (← links)
- Approximating node-weighted \(k\)-MST on planar graphs (Q5918856) (← links)
