Optimal Approximation Algorithms for Multi-agent Combinatorial Problems with Discounted Price Functions
Gagan GoelPushkar TripathiLei WangPublished in: CoRR (2009)
Keyphrases
- approximation algorithms
- combinatorial problems
- worst case
- multi agent
- minimum cost
- np hard
- constant factor
- constraint programming
- exact algorithms
- special case
- constraint satisfaction problems
- dynamic programming
- metaheuristic
- branch and bound algorithm
- vertex cover
- traveling salesman problem
- graph coloring
- constraint satisfaction
- combinatorial optimization
- phase transition
- optimal solution
- open shop
- approximation schemes
- randomized algorithms
- global constraints
- np complete
- approximation ratio
- approximation guarantees
- markov decision processes
- strongly np hard
- set cover
- constant factor approximation
- winner determination
- greedy heuristic
- linear programming
- average reward
- lower bound
- computational complexity
- integer programming