arXiv
Open Access
2012
Notes on Convex Transversals
Lena Schlipf
Abstrak
In this paper, we prove the problem of stabbing a set of disjoint bends by a convex stabber to be NP-hard. We also consider the optimization version of the convex stabber problem and prove this problem to be APX-hard for sets of line segments.
Topik & Kata Kunci
Penulis (1)
L
Lena Schlipf
Akses Cepat
Informasi Jurnal
- Tahun Terbit
- 2012
- Bahasa
- en
- Sumber Database
- arXiv
- Akses
- Open Access ✓