The within-strip discrete unit disk cover problem (Q528480): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+U05
@@ Property / Mathematics Subject Classification ID: 68U05 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+W25
@@ Property / Mathematics Subject Classification ID: 68W25 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6715032
@@ Property / zbMATH DE Number: 6715032 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+computational geometry
@@ Property / zbMATH Keywords: computational geometry / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+geometric set cover
@@ Property / zbMATH Keywords: geometric set cover / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+approximation algorithms
@@ Property / zbMATH Keywords: approximation algorithms / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2017.01.030
+Normal rank
@@ Property / OpenAlex ID @@
+W2592261725
@@ Property / OpenAlex ID: W2592261725 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4504025
@@ Property / cites work: Q4504025 / rank @@
+Normal rank
@@ Property / cites work @@
+PTAS for Weighted Set Cover on Unit Squares
@@ Property / cites work: PTAS for Weighted Set Cover on Unit Squares / rank @@
+Normal rank
@@ Property / cites work @@
+Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs
+Normal rank
@@ Property / cites work @@
+Approximation schemes for covering and packing problems in image processing and VLSI
+Normal rank
@@ Property / cites work @@
+Improved results on geometric hitting set problems
+Normal rank
@@ Property / cites work @@
+The NP-completeness column: An ongoing guide
@@ Property / cites work: The NP-completeness column: An ongoing guide / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal packing and covering in the plane are NP-complete
+Normal rank
@@ Property / cites work @@
+A threshold of ln             <i>n</i>             for approximating set cover
+Normal rank
@@ Property / cites work @@
+The Location of Emergency Service Facilities
@@ Property / cites work: The Location of Emergency Service Facilities / rank @@
+Normal rank
@@ Property / cites work @@
+A Greedy Heuristic for the Set-Covering Problem
@@ Property / cites work: A Greedy Heuristic for the Set-Covering Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Almost optimal set covers in finite VC-dimension
@@ Property / cites work: Almost optimal set covers in finite VC-dimension / rank @@
+Normal rank
@@ Property / cites work @@
+Covering Points by Unit Disks of Fixed Location
@@ Property / cites work: Covering Points by Unit Disks of Fixed Location / rank @@
+Normal rank
@@ Property / cites work @@
+AN IMPROVED LINE-SEPARABLE ALGORITHM FOR DISCRETE UNIT DISK COVER
+Normal rank
@@ Property / cites work @@
+Practical Discrete Unit Disk Cover Using an Exact Line-Separable Algorithm
+Normal rank
@@ Property / cites work @@
+ON THE DISCRETE UNIT DISK COVER PROBLEM
@@ Property / cites work: ON THE DISCRETE UNIT DISK COVER PROBLEM / rank @@
+Normal rank
@@ Property / cites work @@
+New existence proofs ε-nets
@@ Property / cites work: New existence proofs ε-nets / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
+Normal rank
@@ Property / cites work @@
+Q2934693
@@ Property / cites work: Q2934693 / rank @@
+Normal rank
@@ Property / cites work @@
+Simple heuristics for unit disk graphs
@@ Property / cites work: Simple heuristics for unit disk graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Linear Time Approximation for Dominating Sets and Independent Dominating Sets in Unit Disk Graphs
+Normal rank
@@ Property / cites work @@
+NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs
+Normal rank
@@ Property / cites work @@
+A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks
+Normal rank
@@ Property / cites work @@
+Planar Formulae and Their Uses
@@ Property / cites work: Planar Formulae and Their Uses / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation and Online Algorithms
@@ Property / cites work: Approximation and Online Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+A PTAS for the Weighted Unit Disk Cover Problem
@@ Property / cites work: A PTAS for the Weighted Unit Disk Cover Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Covering a set of points in multidimensional space
+Normal rank
@@ Property / cites work @@
+Improved approximation algorithms for geometric set cover
+Normal rank
@@ Property / cites work @@
+The searching over separators strategy to solve some NP-hard problems in subexponential time
+Normal rank
@@ Property / cites work @@
+Exact and approximation algorithms for clustering
@@ Property / cites work: Exact and approximation algorithms for clustering / rank @@
+Normal rank
@@ Property / cites work @@
+Homogeneous 2-hop broadcast in 2D
@@ Property / cites work: Homogeneous 2-hop broadcast in 2D / rank @@
+Normal rank
@@ Property / cites work @@
+The Rectilinear Steiner Tree Problem is $NP$-Complete
+Normal rank
@@ Property / cites work @@
+Some APX-completeness results for cubic graphs
@@ Property / cites work: Some APX-completeness results for cubic graphs / rank @@
+Normal rank
@@ Property / cites work @@
+How to draw a planar graph on a grid
@@ Property / cites work: How to draw a planar graph on a grid / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:528480