Pages that link to "Item:Q2875147"
From MaRDI portal
The following pages link to Approximation schemes for Steiner forest on planar graphs and graphs of bounded treewidth (Q2875147):
Displaying 14 items.
- Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs (Q476424) (← links)
- The Steiner forest problem revisited (Q972355) (← links)
- A PTAS for weight constrained Steiner trees in series--parallel graphs. (Q1401399) (← links)
- Improved Steiner tree algorithms for bounded treewidth (Q1932355) (← links)
- Primal-dual approximation algorithms for node-weighted Steiner forest on planar graphs (Q1951588) (← links)
- Euclidean prize-collecting Steiner forest (Q2429324) (← links)
- Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs (Q2891348) (← links)
- An <i>O</i> ( <i>n</i> log <i>n</i> ) approximation scheme for Steiner tree in planar graphs (Q2930256) (← links)
- Primal-Dual Approximation Algorithms for Node-Weighted Steiner Forest on Planar Graphs (Q3012847) (← links)
- Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs (Q4629967) (← links)
- Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth (Q5395666) (← links)
- (Q5743426) (← links)
- (Q5743427) (← links)
- Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices (Q5857009) (← links)
