Pages that link to "Item:Q2930256"

The following pages link to An <i>O</i> ( <i>n</i> log <i>n</i> ) approximation scheme for Steiner tree in planar graphs (Q2930256):

Displaying 24 items.

• Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs (Q476424) (← links)
• Faster approximation schemes and parameterized algorithms on (odd-)\(H\)-minor-free graphs (Q764332) (← links)
• Near-linear-time deterministic plane Steiner spanners for well-spaced point sets (Q906836) (← links)
• Improved Steiner tree algorithms for bounded treewidth (Q1932355) (← links)
• Connecting face hitting sets in planar graphs (Q1944026) (← links)
• Approximation algorithm with constant ratio for stochastic prize-collecting Steiner tree problem (Q2165784) (← links)
• Mixed integer programming formulations for Steiner tree and quality of service multicast tree problems (Q2226969) (← links)
• Complexity and inapproximability results for balanced connected subgraph problem (Q2232593) (← links)
• Extending the kernel for planar Steiner tree to the number of Steiner vertices (Q2408201) (← links)
• Primal-Dual Approximation Algorithms for Node-Weighted Steiner Forest on Planar Graphs (Q3012847) (← links)
• Parameterized approximation schemes for Steiner trees with small number of Steiner vertices (Q3304124) (← links)
• A Fixed Parameter Tractable Approximation Scheme for the Optimal Cut Graph of a Surface (Q3452802) (← links)
• (Q4525729) (← links)
• Nearly ETH-tight Algorithms for Planar Steiner Tree with Terminals on Few Faces (Q4987446) (← links)
• A PTAS for Three-Edge-Connected Survivable Network Design in Planar Graphs (Q5002603) (← 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)
• 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)
• Correlation clustering and two-edge-connected augmentation for planar graphs (Q6046943) (← links)
• The parameterized complexity of the survivable network design problem (Q6655676) (← links)