Geometric hitting set for segments of few orientations (Q1743112): Difference between revisions

Latest revision as of 11:59, 15 July 2024

scientific article; zbMATH DE number 6545973

Geometric Hitting Set for Segments of Few Orientations

Language	Label	Description	Also known as
English	Geometric hitting set for segments of few orientations	scientific article; zbMATH DE number 6545973	Geometric Hitting Set for Segments of Few Orientations

Statements

instance of

scholarly article

0 references

title

Geometric hitting set for segments of few orientations (English)

0 references

Geometric Hitting Set for Segments of Few Orientations (English)

0 references

zbMATH Open document ID

1384.68021

0 references

1383.68092

0 references

DOI

10.1007/s00224-016-9744-7

0 references

10.1007/978-3-319-28684-6_13

0 references

author

Sándor P. Fekete

0 references

Kan Huang

0 references

Joseph S. B. Mitchell

0 references

Ojas Parekh

0 references

Cynthia A. Phillips

0 references

published in

Theory of Computing Systems

0 references

Approximation and Online Algorithms

0 references

publication date

12 April 2018

0 references

26 February 2016

0 references

full work available at URL

https://arxiv.org/abs/1603.06077

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

set cover

0 references

hitting set

0 references

approximation algorithms

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

0 references

0 references

0 references

A non-linear lower bound for planar epsilon-nets

0 references

Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes

0 references

Q4258216

0 references

A Greedy Heuristic for the Set-Covering Problem

0 references

Q5452284

0 references

Approximability issues of guarding a set of segments

0 references

Experimental Study on Approximation Algorithms for Guarding Sets of Line Segments

0 references

Guarding a set of line segments in the plane

0 references

Approximation algorithms for a geometric set cover problem

0 references

Improved approximation algorithms for geometric set cover

0 references

Almost optimal set covers in finite VC-dimension

0 references

Q2753930

0 references

Algorithms for polytope covering and approximation

0 references

Analytical approach to parallel repetition

0 references

Parameterized Complexity of Stabbing Rectangles and Squares in the Plane

0 references

Q4526990

0 references

On the approximability of covering points by lines and related problems

0 references

Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs

0 references

Hitting sets when the VC-dimension is small

0 references

Q2753937

0 references

Fixed-parameter tractability and lower bounds for stabbing problems

0 references

Approximation algorithms for hitting objects with straight lines

0 references

Approximation schemes for covering and packing problems in image processing and VLSI

0 references

Approximation Algorithms for Hitting Triangle-Free Sets of Line Segments

0 references

Approximation Algorithms for Rectangle Stabbing and Interval Stabbing Problems

0 references

Point Line Cover: The Easy Kernel is Essentially Tight

0 references

Q2754182

0 references

Covering things with things

0 references

On the complexity of locating linear facilities in the plane

0 references

Improved results on geometric hitting set problems

0 references

Tight lower bounds for the size of epsilon-nets

0 references

Q4945523

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1743112

@@ Property / cites work @@
+Q3132896
@@ Property / cites work: Q3132896 / rank @@
+Normal rank
@@ Property / cites work @@
+A non-linear lower bound for planar epsilon-nets
@@ Property / cites work: A non-linear lower bound for planar epsilon-nets / rank @@
+Normal rank
@@ Property / cites work @@
+Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes
+Normal rank
@@ Property / cites work @@
+Q4258216
@@ Property / cites work: Q4258216 / 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 @@
+Q5452284
@@ Property / cites work: Q5452284 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximability issues of guarding a set of segments
+Normal rank
@@ Property / cites work @@
+Experimental Study on Approximation Algorithms for Guarding Sets of Line Segments
+Normal rank
@@ Property / cites work @@
+Guarding a set of line segments in the plane
@@ Property / cites work: Guarding a set of line segments in the plane / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for a geometric set cover problem
+Normal rank
@@ Property / cites work @@
+Improved approximation algorithms for geometric set cover
+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 @@
+Q2753930
@@ Property / cites work: Q2753930 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for polytope covering and approximation
+Normal rank
@@ Property / cites work @@
+Analytical approach to parallel repetition
@@ Property / cites work: Analytical approach to parallel repetition / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Complexity of Stabbing Rectangles and Squares in the Plane
+Normal rank
@@ Property / cites work @@
+Q4526990
@@ Property / cites work: Q4526990 / rank @@
+Normal rank
@@ Property / cites work @@
+On the approximability of covering points by lines and related problems
+Normal rank
@@ Property / cites work @@
+Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs
+Normal rank
@@ Property / cites work @@
+Hitting sets when the VC-dimension is small
@@ Property / cites work: Hitting sets when the VC-dimension is small / rank @@
+Normal rank
@@ Property / cites work @@
+Q2753937
@@ Property / cites work: Q2753937 / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-parameter tractability and lower bounds for stabbing problems
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for hitting objects with straight lines
+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 Hitting Triangle-Free Sets of Line Segments
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Rectangle Stabbing and Interval Stabbing Problems
+Normal rank
@@ Property / cites work @@
+Point Line Cover: The Easy Kernel is Essentially Tight
+Normal rank
@@ Property / cites work @@
+Q2754182
@@ Property / cites work: Q2754182 / rank @@
+Normal rank
@@ Property / cites work @@
+Covering things with things
@@ Property / cites work: Covering things with things / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of locating linear facilities in the plane
+Normal rank
@@ Property / cites work @@
+Improved results on geometric hitting set problems
+Normal rank
@@ Property / cites work @@
+Tight lower bounds for the size of epsilon-nets
@@ Property / cites work: Tight lower bounds for the size of epsilon-nets / rank @@
+Normal rank
@@ Property / cites work @@
+Q4945523
@@ Property / cites work: Q4945523 / rank @@
+Normal rank