Pages that link to "Item:Q3595415"

The following pages link to Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs (Q3595415):

Displaying 37 items.

• Tighter estimates for \(\epsilon\)-nets for disks (Q265723) (← links)
• Time efficient \(k\)-shot broadcasting in known topology radio networks (Q352244) (← links)
• Exact algorithms and APX-hardness results for geometric packing and covering problems (Q390102) (← links)
• A PTAS for the minimum weighted dominating set problem with smooth weights on unit disk graphs (Q437046) (← links)
• Unit disk cover problem in 2D (Q491638) (← links)
• Limits of local search: quality and efficiency (Q527441) (← links)
• The within-strip discrete unit disk cover problem (Q528480) (← links)
• Improved results on geometric hitting set problems (Q603882) (← links)
• Polynomial time approximation schemes for minimum disk cover problems (Q613664) (← links)
• New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs (Q621836) (← links)
• Minimum clique partition in unit disk graphs (Q659693) (← links)
• A \(5+\varepsilon\)-approximation algorithm for minimum weighted dominating set in unit disk graph (Q1006048) (← links)
• A better constant-factor approximation for weighted dominating set in unit disk graph (Q1037452) (← links)
• Approximation algorithms for highly connected multi-dominating sets in unit disk graphs (Q1755744) (← links)
• PTAS for the minimum weighted dominating set in growth bounded graphs (Q1928314) (← links)
• Wireless networking, dominating and packing (Q1958633) (← links)
• An exact algorithm for a class of geometric set-cover problems (Q2030243) (← links)
• Approximating \(k\)-connected \(m\)-dominating sets (Q2144267) (← links)
• Computing a tree having a small vertex cover (Q2272400) (← links)
• Approximation algorithms for the connected sensor cover problem (Q2290655) (← links)
• Approximation algorithm for uniform bounded facility location problem (Q2392747) (← links)
• Maximum lifetime connected coverage with two active-phase sensors (Q2392753) (← links)
• Sensor Cover and Double Partition (Q2820119) (← links)
• Approximation Algorithm for the Uniform Bounded Facility Problem (Q3004651) (← links)
• A PTAS for the Weighted Unit Disk Cover Problem (Q3448847) (← links)
• (6 + ε)-Approximation for Minimum Weight Dominating Set in Unit Disk Graphs (Q3511366) (← links)
• Discrete unit square cover problem (Q4644781) (← links)
• Constant-approximation for minimum weight partial sensor cover (Q5013505) (← links)
• Breaking the <i>O</i>(ln <i>n</i>) Barrier: An Enhanced Approximation Algorithm for Fault-Tolerant Minimum Weight Connected Dominating Set (Q5131722) (← links)
• Domination in Geometric Intersection Graphs (Q5458576) (← links)
• Approximating k-Connected m-Dominating Sets (Q5874545) (← links)
• Algorithms for the line-constrained disk coverage and related problems (Q5896893) (← links)
• A constant-factor approximation algorithm for red-blue set cover with unit disks (Q5918633) (← links)
• Algorithms for the line-constrained disk coverage and related problems (Q5918695) (← links)
• Capacitated discrete unit disk cover (Q5918931) (← links)
• Line segment disk cover (Q5919111) (← links)
• A constant-factor approximation algorithm for red-blue set cover with unit disks (Q5925710) (← links)