The following pages link to (Q5743426):
Displaying 12 items.
- Polynomial time approximation scheme for the rectilinear Steiner arborescence problem (Q1587590) (← links)
- Primal-dual approximation algorithms for node-weighted Steiner forest on planar graphs (Q1951588) (← links)
- Extending the kernel for planar Steiner tree to the number of Steiner vertices (Q2408201) (← links)
- An <i>O</i> ( <i>n</i> log <i>n</i> ) approximation scheme for Steiner tree in planar graphs (Q2930256) (← links)
- Parameterized approximation schemes for Steiner trees with small number of Steiner vertices (Q3304124) (← links)
- Simultaneously load balancing for every p-norm, with reassignments (Q4638106) (← links)
- A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest (Q4962177) (← links)
- Nearly ETH-tight Algorithms for Planar Steiner Tree with Terminals on Few Faces (Q4987446) (← links)
- A Subexponential Parameterized Algorithm for Directed Subset Traveling Salesman Problem on Planar Graphs (Q5071089) (← links)
- Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions) (Q5221061) (← links)
- Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth (Q5395666) (← links)
- Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices (Q5857009) (← links)
