Pages that link to "Item:Q2875147"

The following pages link to Approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth (Q2875147):

Displaying 7 items.

• Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs (Q476424) (← links)
• Improved Steiner tree algorithms for bounded treewidth (Q1932355) (← links)
• Euclidean prize-collecting Steiner forest (Q2429324) (← links)
• Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs (Q2891348) (← links)
• Primal-Dual Approximation Algorithms for Node-Weighted Steiner Forest on Planar Graphs (Q3012847) (← links)
• (Q5743426) (← links)
• (Q5743427) (← links)