Bi-Criteria and Approximation Algorithms for Restricted Matchings.
Monaldo MastrolilliGeorgios StamoulisPublished in: CoRR (2013)
Keyphrases
- approximation algorithms
- bicriteria
- efficient solutions
- np hard
- special case
- knapsack problem
- integer linear programming
- flowshop
- minimum cost
- vertex cover
- worst case
- set cover
- primal dual
- shortest path problem
- scheduling problem
- approximation ratio
- lower bound
- disjoint paths
- combinatorial auctions
- constant factor
- randomized algorithms
- genetic algorithm
- constant factor approximation