Pages that link to "Item:Q2269141"
From MaRDI portal
The following pages link to A near linear time approximation scheme for Steiner tree among obstacles in the plane (Q2269141):
Displaying 4 items.
- An exact algorithm for constructing minimum Euclidean skeletons of polygons (Q2131144) (← links)
- Approximation algorithms for network design problems (Q2920753) (← links)
- An <i>O</i> ( <i>n</i> log <i>n</i> ) approximation scheme for Steiner tree in planar graphs (Q2930256) (← links)
- Dealing with large hidden constants (Q5406254) (← links)