Approximability of Combinatorial Problems with Multi-agent Submodular Cost Functions.
Gagan GoelChinmay KarandePushkar TripathiLei WangPublished in: FOCS (2009)
Keyphrases
- np complete
- combinatorial problems
- constraint satisfaction problems
- cost function
- multi agent
- phase transition
- constraint programming
- constraint satisfaction
- objective function
- np hard
- graph coloring
- approximation algorithms
- metaheuristic
- search space reduction
- combinatorial optimization
- greedy algorithm
- branch and bound algorithm
- multi agent systems
- solving hard
- optimization problems
- traveling salesman problem
- specific problems
- arc consistency
- graph colouring
- global constraints
- reinforcement learning
- optimal solution
- special case
- energy minimization
- combinatorial search
- orders of magnitude
- dynamic programming