Pages that link to "Item:Q3541105"
From MaRDI portal
The following pages link to Faster Steiner Tree Computation in Polynomial-Space (Q3541105):
Displaying 10 items.
- Probability Steiner trees and maximum parsimony in phylogenetic analysis (Q393567) (← links)
- Exponential approximation schemata for some network design problems (Q396669) (← links)
- Faster algorithm for optimum Steiner trees (Q1944205) (← links)
- Fast polynomial-space algorithms using inclusion-exclusion. Improving on Steiner tree and related problems (Q1949736) (← links)
- Algorithmic aspects of Steiner convexity and enumeration of Steiner trees (Q2259027) (← links)
- Computing optimal Steiner trees in polynomial space (Q2392926) (← links)
- Sharp separation and applications to exact and parameterized algorithms (Q2429363) (← links)
- Generating all the Steiner trees and computing Steiner intervals for a fixed number of terminals (Q2840557) (← links)
- Planar k-Path in Subexponential Time and Polynomial Space (Q3104782) (← links)
- Optimal connected subgraphs: Integer programming formulations and polyhedra (Q6064164) (← links)
