An Optimal Online Algorithm for Weighted Bipartite Matching and Extensions to Combinatorial Auctions.
Thomas KesselheimKlaus RadkeAndreas TönnisBerthold VöckingPublished in: ESA (2013)
Keyphrases
- bipartite matching
- dynamic programming
- optimal solution
- combinatorial auctions
- worst case
- maximum weight
- np hard
- linear programming
- approximation algorithms
- resource allocation
- cost function
- particle swarm optimization
- optimal strategy
- objective function
- special case
- simulated annealing
- weighted graph
- search space
- greedy heuristic
- minimum cost flow