Distributed algorithms for weighted problems in sparse graphs.
Andrzej CzygrinowMichal HanckowiakPublished in: J. Discrete Algorithms (2006)
Keyphrases
- optimization problems
- distributed constraint optimization
- graph theory
- theoretical guarantees
- distributed systems
- approximate solutions
- search methods
- test problems
- benchmark problems
- combinatorial optimization
- computational complexity
- computationally efficient
- worst case
- run times
- polynomial time complexity
- weighted graph
- distributed breakout
- problems in computer vision
- partial solutions
- search problems
- evolutionary algorithm
- high dimensional