Pages that link to "Item:Q1587590"
From MaRDI portal
The following pages link to Polynomial time approximation scheme for the rectilinear Steiner arborescence problem (Q1587590):
Displaying 12 items.
- Linear-size planar Manhattan network for convex point sets (Q824337) (← links)
- Flip distance between triangulations of a simple polygon is NP-complete (Q894685) (← links)
- The rectilinear Steiner arborescence problem (Q1186802) (← links)
- Approximating the generalized minimum Manhattan network problem (Q1751089) (← links)
- Polynomial time approximation scheme for symmetric rectilinear Steiner arborescence problem (Q1850838) (← links)
- Approximating minimum Manhattan networks in higher dimensions (Q2258071) (← links)
- Angle-restricted Steiner arborescences for flow map layout (Q2354031) (← links)
- Optimal Competitiveness for the Rectilinear Steiner Arborescence Problem (Q3449515) (← links)
- (Q4952700) (← links)
- A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest (Q4962177) (← links)
- Non-crossing geometric steiner arborescences (Q5136274) (← links)
- Dynamic programming approach to the generalized minimum Manhattan network problem (Q5918463) (← links)