Pages that link to "Item:Q4242784"
From MaRDI portal
The following pages link to A polynomial time algorithm for rectilinear Steiner trees with terminals constrained to curves (Q4242784):
Displaying 6 items.
- Embedding rectilinear Steiner trees with length restrictions (Q344768) (← links)
- Polynomially solvable special cases of the Steiner problem in planar networks (Q1179749) (← links)
- The Steiner tree problem for terminals on the boundary of a rectilinear polygon (Q1566725) (← links)
- Fixed-parameter algorithms for rectilinear Steiner tree and rectilinear traveling salesman problem in the plane (Q1651693) (← links)
- Steiner Trees for Terminals Constrained to Curves (Q3128200) (← links)
- An optimal algorithm for rectilinear steiner trees for channels with obstacles (Q3985984) (← links)