Pages that link to "Item:Q2391178"
From MaRDI portal
The following pages link to Approximation schemes for node-weighted geometric Steiner tree problems (Q2391178):
Displaying 10 items.
- Optimal relay node placement in delay constrained wireless sensor network design (Q297218) (← links)
- Approximation schemes for NP-hard geometric optimization problems: a survey (Q1403283) (← links)
- Improved methods for approximating node weighted Steiner trees and connected dominating sets. (Q1854264) (← links)
- Approximation algorithms for constructing required subgraphs using stock pieces of fixed length (Q2082192) (← links)
- A PTAS for the geometric connected facility location problem (Q2408564) (← links)
- The node-weighted steiner tree problem (Q3789370) (← links)
- (Q4887736) (← links)
- (Q5009594) (← links)
- Two Constant Approximation Algorithms for Node-Weighted Steiner Tree in Unit Disk Graphs (Q5505666) (← links)
- Solving the prize‐collecting Euclidean Steiner tree problem (Q6071078) (← links)