Pages that link to "Item:Q2429324"
From MaRDI portal
The following pages link to Euclidean prize-collecting Steiner forest (Q2429324):
Displaying 7 items.
- Exact algorithms for budgeted prize-collecting covering subgraph problems (Q2147080) (← links)
- A PTAS for the geometric connected facility location problem (Q2408564) (← links)
- Approximation schemes for Steiner forest on planar graphs and graphs of bounded treewidth (Q2875147) (← links)
- Colored Non-crossing Euclidean Steiner Forest (Q3459881) (← links)
- Euclidean Prize-Collecting Steiner Forest (Q3557044) (← links)
- (Q5009572) (← links)
- A PTAS for the Steiner Forest Problem in Doubling Metrics (Q5376440) (← links)