On the discrete Unit Disk Cover Problem

No abstract is available for this paper.

• Publication year

  2011

• Venue

  International journal of computational geometry and applications

• Publication date

  2011-02-18

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1142/S0218195912500094
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Improved Results on Geometric Hitting Set Problems

  2010influential reference
• An Improved Line-Separable Algorithm for Discrete Unit Disk Cover

  2010cited by this paper
• Covering Points by Unit Disks of Fixed Location

  2007cited by this paper
• A linear work, O(n1/6) time, parallel algorithm for solving planar Laplacians

  2007cited by this paper
• An Improved Approximation Factor For The Unit Disk Covering Problem

  2006cited by this paper
• Exact and Approximation Algorithms for Clustering

  2001cited by this paper
• Selecting Forwarding Neighbors in Wireless Ad Hoc Networks

  2001cited by this paper
• Computational Geometry: Algorithms and Applications, Second Edition

  2000cited by this paper
• Efficient algorithms for geometric optimization

  1998cited by this paper
• Exact and Approximation Algortihms for Clustering

  1997cited by this paper
• A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP

  1997cited by this paper
• Computational geometry: algorithms and applications

  1997cited by this paper
• Almost optimal set covers in finite VC-dimension

  1995cited by this paper
• The searching over separators strategy to solve some NP-hard problems in subexponential time

  1993cited by this paper
• Covering a Set of Points in Multidimensional Space

  1991cited by this paper
• Fast Algorithms for Shortest Paths in Planar Graphs, with Applications

  1987cited by this paper
• Approximation schemes for covering and packing problems in image processing and VLSI

  1985cited by this paper
• The NP-Completeness Column: An Ongoing Guide

  1982influential reference
• Optimal Packing and Covering in the Plane are NP-Complete

  1981influential reference
• A Greedy Heuristic for the Set-Covering Problem

  1979cited by this paper

• A Reinforcement-Learning-Based Energy Charging Strategy for Agricultural Internet of Things With Multi-UAV-Assisted WRSN

  2025cites this paper
• Minimum Overlap Difference in Dual Masting of GSM Network Design

  2025cites this paper
• Multi-Objective Optimization for Charging Paths Planning and Energy Efficiency in UAV-Assisted Wireless Rechargeable Sensor Networks

  2025cites this paper
• Octagonal-square tessellation model for masting GSM network: A case study of MTN Kumasi-East, Ghana

  2024cites this paper
• Extended mechanical loads for the analysis of acetabular cages

  2023cites this paper
• Joint Scheduling and Trajectory Optimization of Charging UAV in Wireless Rechargeable Sensor Networks

  2022cites this paper
• Location determination of hierarchical service facilities using a multi-layered greedy heuristic approach

  2022cites this paper
• A Constant–Factor Approximation Algorithm for Red–Blue Set Cover with Unit Disks

  2022cites this paper
• Experiments with Unit Disk Cover Algorithms for Covering Massive Pointsets

  2022cites this paper
• Fair Throughput Optimization with a Dynamic Network of Drone Relays

  2022cites this paper
• Geometric Piercing Set Problem in Wireless Sensor Networks

  2021cites this paper
• Efficient Algorithms for Point and Area Sweep–Coverage in Wireless Sensor Networks

  2021cites this paper
• On Geometric Priority Set Cover Problems

  2021cites this paper
• A Brief Survey on Placement of Access Points in Ultra-Dense Heterogeneous 5G Networks

  2020cites this paper
• Comparison of energy demands of drone-based and ground-based parcel delivery services

  2020cites this paper
• Acoustical properties in emergency warning siren coverage planning

  2020cites this paper
• Minimum Ply Covering of Points with Convex Shapes

  2020cites this paper
• An exact algorithm for a class of geometric set-cover problems

  2020cites this paper
• Capacitated discrete unit disk cover

  2020cites this paper
• Coverage Optimization with a Dynamic Network of Drone Relays

  2020cites this paper
• Trajectory Optimization for UAVs’ Efficient Charging in Wireless Rechargeable Sensor Networks

  2020cites this paper
• 2 Improved Local Search for Geometric Hitting Set

  2019cites this paper
• Unit Disk Cover for Massive Point Sets

  2019cites this paper
• Fair Cellular Throughput Optimization with the Aid of Coordinated Drones

  2019cites this paper
• Discrete unit square cover problem

  2018cites this paper
• Approximation Algorithms for Geometric Clustering and Touring Problems

  2018cites this paper
• Algorithms and Discrete Applied Mathematics: 4th International Conference, CALDAM 2018, Guwahati, India, February 15-17, 2018, Proceedings

  2018influential citation
• Line Segment Disk Cover

  2018cites this paper
• Placement of access points in an ultra-dense 5G network with optimum power and bandwidth

  2018cites this paper
• Is a Finite Intersection of Balls Covered by a Finite Union of Balls in Euclidean Spaces?

  2018cites this paper
• Capacitated Discrete Unit Disk Cover

  2018cites this paper
• Exploiting Robotic Swarm Characteristics for Adversarial Subversion in Coverage Tasks

  2017cites this paper
• The Within-Strip Discrete Unit Disk Cover Problem

  2017cites this paper
• Online Unit Covering in Euclidean Space

  2017cites this paper
• Coverage Algorithms for WiFO: A Hybrid FSO-WiFi Femtocell Communication System

  2017cites this paper
• Online unit covering in L2

  2017cites this paper
• Solving energy issues for sweep coverage in wireless sensor networks

  2017cites this paper
• Placement of access points with minimal wastage of transmission power in an indoor environment

  2017cites this paper
• Proceedings of the 28th Canadian Conference on Computational Geometry, CCCG 2016, August 3-5, 2016, Simon Fraser University, Vancouver, British Columbia, Canada

  2016cites this paper
• The approximation algorithms for a class of multiple-choice problem

  2016cites this paper
• Minimizing Uncertainty through Sensor Placement with Angle Constraints

  2016cites this paper
• Algorithms for Geometric Covering Problems

  2016influential citation
• Limits of Local Search: Quality and Efficiency

  2016cites this paper
• Covering Segments with Unit Squares

  2016cites this paper
• Energy Efficient Sweep Coverage with Mobile and Static Sensors

  2015cites this paper
• Unit Covering in Color-Spanning Set Model

  2015cites this paper
• Tighter Estimates for epsilon-nets for Disks

  2015cites this paper
• Minimized Cost Gateway Deployment in Cyber-Physical Systems

  2015influential citation
• An energy-conserving algorithm for the collection and reporting of data in mobile sensor networks

  2015cites this paper
• Improved Local Search for Geometric Hitting Set

  2015cites this paper
• Approximation algorithm for sweep coverage on graph

  2015cites this paper
• Deploying R&D sensors to monitor heterogeneous objects and accomplish temporal coverage

  2015cites this paper
• Tighter Estimates for epsilon-nets for Disks

  2015cites this paper
• Minimum Dominating Set Problem for Unit Disks Revisited

  2015cites this paper
• Linear Time Approximation Algorithms for the Relay Node Placement Problem in Wireless Sensor Networks with Hexagon Tessellation

  2015cites this paper
• The use of geometric structures in graphics and optimization

  2015cites this paper
• Discretization of Planar Geometric Cover Problems

  2014cites this paper
• Following a curve with the discrete Fréchet distance

  2014cites this paper
• QPTAS for Geometric Set-Cover Problems via Optimal Separators

  2014cites this paper
• An Efficient Deployment Heuristic to Support Temporal Coverage of Heterogeneous Objects in Rotatable and Directional (R&D) Sensor Networks

  2014cites this paper
• Line sweep coverage in wireless sensor networks

  2014cites this paper
• Approximation algorithms for sweep coverage in wireless sensor networks

  2014influential citation
• Complexity Analysis of Heuristic Pulse Interleaving Algorithms for Multi-Target Tracking with Multiple Simultaneous Receive Beams

  2014cites this paper
• Point and area sweep coverage in wireless sensor networks

  2013cites this paper
• Discretely Following a Curve

  2013cites this paper
• Minimum Dominating Set for a Point Set in $\IR^2$

  2013cites this paper
• The discrete Frechet distance with applications

  2013cites this paper
• Approximations of Points: Combinatorics and Algorithms

  2013cites this paper
• Approximation Algorithms for a Variant of discrete Piercing Set Problem for Unit Disks

  2013cites this paper
• THE DISCRETE FR ECHET DISTANCE AND APPLICATIONS

  2013cites this paper
• Unit disk cover problem in 2D

  2013cites this paper
• Algorithms for Geometric Covering and Piercing Problems

  2012cites this paper
• Using Rotatable and Directional (R&D) Sensors to Achieve Temporal Coverage of Objects and Its Surveillance Application

  2012cites this paper
• Unit Disk Cover Problem

  2012influential citation
• Approximation Algorithms for the Discrete Piercing Set Problem for Unit Disks

  2011cites this paper
• A Geometric Tiling Algorithm for Approximating Minimal Covering Sets

  2011cites this paper
• E-compagnion:Decomposition methods for the beam-layout optimization problem

  year unknowncites this paper