Pages that link to "Item:Q5958113"

The following pages link to Approximations for Steiner trees with minimum number of Steiner points (Q5958113):

Displaying 28 items.

• Improved approximation algorithms for single-tiered relay placement (Q266064) (← links)
• Approximations for constructing tree-form structures using specific material with fixed length (Q315511) (← links)
• A survey on relay placement with runtime and approximation guarantees (Q465673) (← links)
• New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs (Q621836) (← links)
• Relay placement for fault tolerance in wireless networks in higher dimensions (Q632722) (← links)
• Node-weighted Steiner tree approximation in unit disk graphs (Q849134) (← links)
• Wireless network design via 3-decompositions (Q990943) (← links)
• Algorithms for connected set cover problem and fault-tolerant connected set cover problem (Q1006053) (← links)
• Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation (Q1028460) (← links)
• Exact computation of Steiner minimal trees in the plane (Q1076029) (← links)
• On Steiner minimal trees with \(L_ p\) distance (Q1186795) (← links)
• A note on the MST heuristic for bounded edge-length Steiner trees with minimum number of Steiner points (Q1607061) (← links)
• Approximation algorithms for constructing specific subgraphs with minimum number of length-bounded stock pieces (Q1641150) (← links)
• Minimum rectilinear Steiner tree of \(n\) points in the unit square (Q1699296) (← links)
• Approximating Steiner trees and forests with minimum number of Steiner points (Q1796259) (← links)
• Computing Steiner points for gradient-constrained minimum networks (Q1952503) (← links)
• Combination algorithms for Steiner tree variants (Q2700384) (← links)
• Approximating minimum Steiner point trees in Minkowski planes (Q3064040) (← links)
• Approximating Steiner Trees and Forests with Minimum Number of Steiner Points (Q3453286) (← links)
• (6 + ε)-Approximation for Minimum Weight Dominating Set in Unit Disk Graphs (Q3511366) (← links)
• (Q3640350) (← links)
• IDENTIFYING STEINER MINIMAL TREES ON FOUR POINTS IN SPACE (Q3646210) (← links)
• (Q4369631) (← links)
• (Q4525729) (← links)
• Multicast<i>ad hoc</i>routing through mobility-aware Steiner tree meshes with consistency across different mobility models (Q5481720) (← links)
• Two Constant Approximation Algorithms for Node-Weighted Steiner Tree in Unit Disk Graphs (Q5505666) (← links)
• Wire segmenting for buffer insertion based on RSTP-MSP (Q5958123) (← links)
• Minimum Steiner trees on a set of concyclic points and their center (Q6071053) (← links)