Bi-criteria and approximation algorithms for restricted matchings.
Monaldo MastrolilliGeorgios StamoulisPublished in: Theor. Comput. Sci. (2014)
Keyphrases
- approximation algorithms
- bicriteria
- np hard
- efficient solutions
- special case
- knapsack problem
- integer linear programming
- flowshop
- vertex cover
- worst case
- minimum cost
- shortest path problem
- approximation ratio
- set cover
- primal dual
- disjoint paths
- constant factor
- scheduling problem
- combinatorial auctions
- processing times
- greedy algorithm
- resource allocation
- np complete
- randomized algorithms
- dynamic programming
- lower bound