Geometric Hitting Set for Segments of Few Orientations
Journal Article
·
· Theory of Computing Systems
- Braunschweig Univ. of Technology (Germany)
- Stony Brook Univ., NY (United States)
- Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
In this paper, we study several natural instances of the geometric hitting set problem for input consisting of sets of line segments (and rays, lines) having a small number of distinct slopes. These problems model path monitoring (e.g., on road networks) using the fewest sensors (the “hitting points”). We give approximation algorithms for cases including (i) lines of 3 slopes in the plane, (ii) vertical lines and horizontal segments, (iii) pairs of horizontal/vertical segments. We give hardness and hardness of approximation results for these problems. Finally, we prove that the hitting set problem for vertical lines and horizontal rays is polynomially solvable.
- Research Organization:
- Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Stony Brook Univ., NY (United States)
- Sponsoring Organization:
- USDOE National Nuclear Security Administration (NNSA); SNL Laboratory Directed Research and Development (LDRD) Program; US-Israel Binational Science Foundation; National Science Foundation (NSF)
- Grant/Contract Number:
- AC04-94AL85000; 2010074; CCF-1018388; CCF-1526406
- OSTI ID:
- 1464175
- Report Number(s):
- SAND-2016-12946J; 650133
- Journal Information:
- Theory of Computing Systems, Vol. 62, Issue 2; ISSN 1432-4350
- Publisher:
- SpringerCopyright Statement
- Country of Publication:
- United States
- Language:
- English
Cited by: 3 works
Citation information provided by
Web of Science
Web of Science
Graphs with equal domination and covering numbers
|
journal | October 2019 |
Graphs with equal domination and covering numbers | text | January 2018 |
Similar Records
Geometric hitting set for segments of few orientations.
Geometric Hitting Set for Segments of Few Orientations.
Approximation algorithms for network design problems on bounded subsets
Conference
·
Thu Oct 01 00:00:00 EDT 2015
·
OSTI ID:1464175
+2 more
Geometric Hitting Set for Segments of Few Orientations.
Conference
·
Tue Sep 01 00:00:00 EDT 2015
·
OSTI ID:1464175
+2 more
Approximation algorithms for network design problems on bounded subsets
Conference
·
Sat Dec 31 00:00:00 EST 1994
·
OSTI ID:1464175