Pages that link to "Item:Q5470711"
From MaRDI portal
The following pages link to The Rectilinear Steiner Arborescence Problem Is NP-Complete (Q5470711):
Displaying 11 items.
- Embedding rectilinear Steiner trees with length restrictions (Q344768) (← links)
- Steiner trees with bounded RC-delay (Q527413) (← links)
- Linear-size planar Manhattan network for convex point sets (Q824337) (← links)
- Swap-vertex based neighborhood for Steiner tree problems (Q1699620) (← links)
- Approximating the generalized minimum Manhattan network problem (Q1751089) (← links)
- Angle-restricted Steiner arborescences for flow map layout (Q2354031) (← links)
- Regular Language Constrained Sequence Alignment Revisited (Q3000526) (← links)
- The Rectilinear Steiner Tree Problem with Given Topology and Length Restrictions (Q3196405) (← links)
- Steiner Trees with Bounded RC-Delay (Q3453297) (← links)
- Dynamic programming approach to the generalized minimum Manhattan network problem (Q5918463) (← links)
- Precedence-constrained arborescences (Q6109804) (← links)
