Pages that link to "Item:Q4179026"
From MaRDI portal
The following pages link to The Rectilinear Steiner Tree Problem is $NP$-Complete (Q4179026):
Displaying 6 items.
- Balancing problems in acyclic networks (Q1327220) (← links)
- Network pollution games (Q1755784) (← links)
- Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues (Q1892937) (← links)
- Improved Steiner tree algorithms for bounded treewidth (Q1932355) (← links)
- Towards optimal kernel for connected vertex cover in planar graphs (Q1949125) (← links)
- Computing optimal Steiner trees in polynomial space (Q2392926) (← links)
