Efficient constant factor approximation algorithms for stabbing line segments with equal disks.
Konstantin KobylkinPublished in: CoRR (2018)
Keyphrases
- approximation algorithms
- constant factor
- line segments
- np hard
- special case
- worst case
- hough transform
- lower bound
- vertex cover
- straight line
- minimum cost
- upper bound
- randomized algorithms
- ellipse detection
- primal dual
- perspective images
- straight line segments
- machine learning
- constant factor approximation
- combinatorial auctions
- linear programming
- objective function