Pages that link to "Item:Q4962177"
From MaRDI portal
The following pages link to A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest (Q4962177):
Displaying 11 items.
- A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing (Q494936) (← links)
- Quasilinear approximation scheme for Steiner multi cycle in the Euclidean plane (Q2132394) (← links)
- Randomized approximation scheme for Steiner multi cycle in the Euclidean plane (Q2192387) (← links)
- A PTAS for the geometric connected facility location problem (Q2408564) (← links)
- Euclidean prize-collecting Steiner forest (Q2429324) (← links)
- Approximation Schemes for Capacitated Geometric Network Design (Q4556954) (← links)
- (Q5009572) (← links)
- A PTAS for the Steiner Forest Problem in Doubling Metrics (Q5376440) (← links)
- (Q5743426) (← links)
- (Q5743427) (← links)
- Approximations for the Steiner multicycle problem (Q6634374) (← links)
