Experimental Study on Approximation Algorithms for Guarding Sets of Line Segments.
Valentin E. BrimkovAndrew LeachMichael MastroianniJimmy WuPublished in: ISVC (1) (2010)
Keyphrases
- experimental study
- approximation algorithms
- line segments
- np hard
- hough transform
- vertex cover
- special case
- straight line
- worst case
- minimum cost
- digital pictures
- aerial images
- facility location problem
- set cover
- perspective images
- ellipse detection
- network design problem
- primal dual
- open shop
- disjoint paths
- circular arcs
- approximation schemes
- experimental evaluation
- precedence constraints
- randomized algorithms
- synthetic datasets
- intersection points
- undirected graph
- constant factor
- constant factor approximation
- approximation guarantees
- dynamic programming