A local algorithm for dominating sets of quasi-unit disk graphs.
Yonatan CohenJaroslav OpatrnyPublished in: C3S2E (2009)
Keyphrases
- learning algorithm
- optimization algorithm
- experimental evaluation
- dynamic programming
- cost function
- times faster
- computationally efficient
- search space
- recognition algorithm
- computational complexity
- optimal solution
- improved algorithm
- worst case
- high accuracy
- objective function
- k means
- matching algorithm
- detection algorithm
- theoretical analysis
- preprocessing
- significant improvement
- minimum spanning tree
- adjacency graph
- graph construction
- scheduling problem
- ant colony optimization
- data sets
- computational cost
- np hard
- neural network