Pages that link to "Item:Q1186802"
From MaRDI portal
The following pages link to The rectilinear Steiner arborescence problem (Q1186802):
Displaying 17 items.
- Embedding rectilinear Steiner trees with length restrictions (Q344768) (← links)
- Steiner trees with bounded RC-delay (Q527413) (← links)
- A series of approximation algorithms for the acyclic directed Steiner tree problem (Q679453) (← links)
- Linear-size planar Manhattan network for convex point sets (Q824337) (← links)
- Flip distance between triangulations of a simple polygon is NP-complete (Q894685) (← links)
- Extending the quadrangle inequality to speed-up dynamic programming (Q1321816) (← links)
- A deep-submicron Steiner tree. (Q1597158) (← links)
- Approximating the generalized minimum Manhattan network problem (Q1751089) (← links)
- Two variations of the minimum Steiner problem (Q1774532) (← links)
- Equispreading tree in Manhattan distance (Q1924408) (← links)
- Angle-restricted Steiner arborescences for flow map layout (Q2354031) (← links)
- A rounding algorithm for approximating minimum Manhattan networks (Q2474072) (← links)
- A catalog of Hanan grid problems (Q2748382) (← links)
- The Rectilinear Steiner Tree Problem with Given Topology and Length Restrictions (Q3196405) (← links)
- Optimal Competitiveness for the Rectilinear Steiner Arborescence Problem (Q3449515) (← links)
- Steiner Trees with Bounded RC-Delay (Q3453297) (← links)
- Dynamic programming approach to the generalized minimum Manhattan network problem (Q5918463) (← links)
