Pages that link to "Item:Q4344454"

The following pages link to An approximation scheme for some Steiner tree problems in the plane (Q4344454):

Displaying 21 items.

• PTAS for minimum weighted connected vertex cover problem with \(c\)-local condition in unit disk graphs (Q411246) (← links)
• A PTAS for minimum weighted connected vertex cover \(P_3\) problem in 3-dimensional wireless sensor networks (Q512868) (← links)
• New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs (Q621836) (← links)
• PTAS for connected vertex cover in unit disk graphs (Q1040582) (← links)
• A polynomial time approximation scheme for the grade of service Steiner minimum tree problem (Q1810876) (← links)
• Parallel approximation schemes for a class of planar and near planar combinatorial optimization problems. (Q1854505) (← links)
• Generalised \(k\)-Steiner tree problems in normed planes (Q2258073) (← links)
• A near linear time approximation scheme for Steiner tree among obstacles in the plane (Q2269141) (← links)
• Approximation schemes for node-weighted geometric Steiner tree problems (Q2391178) (← links)
• PTAS for the minimum \(k\)-path connected vertex cover problem in unit disk graphs (Q2392763) (← links)
• Extending the kernel for planar Steiner tree to the number of Steiner vertices (Q2408201) (← links)
• A PTAS for the minimum weight connected vertex cover \(P_3\) problem on unit disk graphs (Q2512658) (← links)
• An <i>O</i> ( <i>n</i> log <i>n</i> ) approximation scheme for Steiner tree in planar graphs (Q2930256) (← links)
• THE EFFECT OF ASYMMETRY ON THE ON-LINE MULTICAST ROUTING PROBLEM (Q3021994) (← links)
• Improved Approximations for the Steiner Tree Problem (Q4314498) (← links)
• (Q4525729) (← links)
• Nearly ETH-tight Algorithms for Planar Steiner Tree with Terminals on Few Faces (Q4987446) (← links)
• Numerical approximation of the Steiner problem in dimension $2$ and $3$ (Q5235091) (← links)
• Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth (Q5395666) (← links)
• Polynomial Time Approximation Scheme for Connected Vertex Cover in Unit Disk Graph (Q5505664) (← links)
• Approximations for Steiner trees with minimum number of Steiner points (Q5958113) (← links)