Pages that link to "Item:Q2867093"
From MaRDI portal
The following pages link to Speeding Up Dynamic Programming with Representative Sets (Q2867093):
Displaying 5 items.
- New analysis and computational study for the planar connected dominating set problem (Q328712) (← links)
- Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm (Q1699613) (← links)
- Speeding up dynamic programming with representative sets: an experimental evaluation of algorithms for Steiner Tree on tree decompositions (Q2343089) (← links)
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth (Q2347800) (← links)
- Strong Steiner Tree Approximations in Practice (Q4629541) (← links)