Approximation algorithm for sweep coverage on graph.
Barun GorainPartha Sarathi MandalPublished in: Inf. Process. Lett. (2015)
Keyphrases
- learning algorithm
- graph structure
- preprocessing
- computational cost
- optimal solution
- detection algorithm
- dynamic programming
- similarity measure
- graph partitioning
- cost function
- search space
- np hard
- graph based algorithm
- approximation ratio
- k means
- convergence rate
- maximum flow
- graph model
- solution path
- approximation algorithms
- error bounds
- tree structure
- clustering method
- random walk
- linear programming
- probabilistic model
- significant improvement