Covering segments with unit squares (Q5894547): Difference between revisions

← Older edit

@@ description / en / description / en @@
+scientific article; zbMATH DE number 6778691
@@ Property / zbMATH Open document ID @@
+.68230
@@ Property / zbMATH Open document ID: 1470.68230 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/978-3-319-62127-2_1
@@ Property / DOI: 10.1007/978-3-319-62127-2_1 / rank @@
+Normal rank
@@ Property / published in @@
+Lecture Notes in Computer Science
@@ Property / published in: Lecture Notes in Computer Science / rank @@
+Normal rank
@@ Property / publication date @@
+September 2017Timestamp +2017-09-22T00:00:00Z
Timezone +00:00
Calendar Gregorian
Precision 1 day
Before 0
After 0
-Timestamp
++2017-09-22T00:00:00Z
-Timezone
++00:00
-Calendar
+Gregorian
-Precision
+day
 Before
 After
@@ Property / publication date: 22 September 2017 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6778691
@@ Property / zbMATH DE Number: 6778691 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+PTAS
@@ Property / zbMATH Keywords: PTAS / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2540164296
@@ Property / OpenAlex ID: W2540164296 / rank @@
+Normal rank
@@ Property / cites work @@
+Covering segments with unit squares
@@ Property / cites work: Covering segments with unit squares / rank @@
+Normal rank
@@ Property / cites work @@
+Reducibility among Combinatorial Problems
@@ Property / cites work: Reducibility among Combinatorial Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Computational complexity of the vertex cover problem in the class of planar triangulations
+Normal rank
@@ Property / cites work @@
+Selecting and covering colored points
@@ Property / cites work: Selecting and covering colored points / rank @@
+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 @@
+AN IMPROVED LINE-SEPARABLE ALGORITHM FOR DISCRETE UNIT DISK COVER
+Normal rank
@@ Property / cites work @@
+Improved results on geometric hitting set problems
+Normal rank
@@ Property / cites work @@
+Q5743501
@@ Property / cites work: Q5743501 / rank @@
+Normal rank
@@ Property / cites work @@
+Limits of local search: quality and efficiency
@@ Property / cites work: Limits of local search: quality and efficiency / rank @@
+Normal rank
@@ Property / cites work @@
+Choice Is Hard
@@ Property / cites work: Choice Is Hard / rank @@
+Normal rank
@@ Property / cites work @@
+The Problem of Compatible Representatives
@@ Property / cites work: The Problem of Compatible Representatives / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation schemes for covering and packing problems in image processing and VLSI
+Normal rank
@@ Property / cites work @@
+APPROXIMATION ALGORITHMS FOR A VARIANT OF DISCRETE PIERCING SET PROBLEM FOR UNIT DISKS
+Normal rank
@@ Property / cites work @@
+Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for the unit disk cover problem in 2D and 3D
+Normal rank
@@ Property / cites work @@
+The Geometry of Scheduling
@@ Property / cites work: The Geometry of Scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem
+Normal rank