Pages that link to "Item:Q1186802"
From MaRDI portal
The following pages link to The rectilinear Steiner arborescence problem (Q1186802):
Displayed 7 items.
- A series of approximation algorithms for the acyclic directed Steiner tree problem (Q679453) (← links)
- Extending the quadrangle inequality to speed-up dynamic programming (Q1321816) (← links)
- A deep-submicron Steiner tree. (Q1597158) (← links)
- Two variations of the minimum Steiner problem (Q1774532) (← links)
- Equispreading tree in Manhattan distance (Q1924408) (← links)
- A rounding algorithm for approximating minimum Manhattan networks (Q2474072) (← links)
- A catalog of Hanan grid problems (Q2748382) (← links)