A Generic Algorithm for Approximately Solving Stochastic Graph Optimization Problems.
Ei AndoHirotaka OnoMasafumi YamashitaPublished in: SAGA (2009)
Keyphrases
- cost function
- learning algorithm
- graph structure
- monte carlo
- preprocessing
- worst case
- optimization problems
- computational complexity
- graph based algorithm
- dynamic programming
- combinatorial optimization
- optimization algorithm
- spanning tree
- probabilistic model
- optimal solution
- objective function
- genetic algorithm
- detection algorithm
- random walk
- matching algorithm
- particle swarm optimization
- directed graph
- convergence rate
- bipartite graph
- undirected graph
- graph construction
- dominating set