Pages that link to "Item:Q5395666"

The following pages link to Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth (Q5395666):

Displaying 36 items.

• Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs (Q476424) (← links)
• On the complexity of the regenerator location problem treewidth and other parameters (Q896670) (← links)
• The Steiner forest problem revisited (Q972355) (← links)
• A PTAS for weight constrained Steiner trees in series--parallel graphs. (Q1401399) (← links)
• Primal-dual approximation algorithms for node-weighted Steiner forest on planar graphs (Q1951588) (← links)
• Placing Green bridges optimally, with a multivariate analysis (Q2117784) (← links)
• Quasilinear approximation scheme for Steiner multi cycle in the Euclidean plane (Q2132394) (← links)
• Randomized approximation scheme for Steiner multi cycle in the Euclidean plane (Q2192387) (← links)
• A 2-approximation algorithm and beyond for the minimum diameter \(k\)-Steiner forest problem (Q2201993) (← links)
• Stronger MIP formulations for the Steiner forest problem (Q2227541) (← links)
• An improved algorithm for the Steiner tree problem with bounded edge-length (Q2237889) (← links)
• On the intersection graph of the disks with diameters the sides of a convex \(n\)-gon (Q2245950) (← links)
• Euclidean prize-collecting Steiner forest (Q2429324) (← links)
• Approximation schemes for Steiner forest on planar graphs and graphs of bounded treewidth (Q2875147) (← links)
• An <i>O</i> ( <i>n</i> log <i>n</i> ) approximation scheme for Steiner tree in planar graphs (Q2930256) (← links)
• An Efficient Approximation Algorithm for the Steiner Tree Problem (Q3297834) (← links)
• Parameterized approximation schemes for Steiner trees with small number of Steiner vertices (Q3304124) (← links)
• (Q4525729) (← links)
• Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs (Q4629967) (← links)
• A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest (Q4962177) (← links)
• Efficient Black-Box Reductions for Separable Cost Sharing (Q4991670) (← links)
• A PTAS for Three-Edge-Connected Survivable Network Design in Planar Graphs (Q5002603) (← links)
• (Q5002844) (← links)
• An Exact Algorithm for the Steiner Forest Problem (Q5009640) (← links)
• Hitting Weighted Even Cycles in Planar Graphs (Q5048307) (← links)
• A Subexponential Parameterized Algorithm for Directed Subset Traveling Salesman Problem on Planar Graphs (Q5071089) (← links)
• A Near-Linear Approximation Scheme for Multicuts of Embedded Graphs With a Fixed Number of Terminals (Q5149755) (← links)
• Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions) (Q5221061) (← links)
• A PTAS for the Steiner Forest Problem in Doubling Metrics (Q5376440) (← links)
• Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices (Q5857009) (← links)
• Travelling on graphs with small highway dimension (Q5925522) (← links)
• Correlation clustering and two-edge-connected augmentation for planar graphs (Q6046943) (← links)
• Approximation algorithms for Steiner forest: An experimental study (Q6065858) (← links)
• Fission: Practical algorithms for computing minimum balanced node separators (Q6115756) (← links)
• Placing green bridges optimally, with a multivariate analysis (Q6635698) (← links)
• The parameterized complexity of the survivable network design problem (Q6655676) (← links)