A Polynomial-Time Algorithm for Action Graph Games.
Albert Xin JiangKevin Leyton-BrownPublished in: AAAI (2006)
Keyphrases
- computational complexity
- worst case
- tree structure
- dynamic programming
- preprocessing
- min cost
- search space
- expectation maximization
- detection algorithm
- dominating set
- minimum spanning tree
- spanning tree
- learning algorithm
- random walk
- similarity measure
- np hard
- special case
- optimal solution
- k means
- graph construction
- polynomial time complexity
- graph isomorphism
- graph based algorithm
- max flow
- randomized algorithm
- approximation ratio
- particle swarm optimization
- lower bound
- weighted graph
- graph structure
- matching algorithm
- simulated annealing