Improved Constant-Time Approximation Algorithms for Maximum Matchings and Other Optimization Problems.
Yuichi YoshidaMasaki YamamotoHiro ItoPublished in: SIAM J. Comput. (2012)
Keyphrases
- approximation algorithms
- optimization problems
- np hard
- special case
- worst case
- vertex cover
- set cover
- cost function
- facility location problem
- minimum cost
- evolutionary algorithm
- approximation ratio
- randomized algorithms
- precedence constraints
- metaheuristic
- undirected graph
- approximation schemes
- combinatorial auctions
- primal dual
- exact algorithms
- traveling salesman problem
- combinatorial optimization
- np hardness
- open shop
- mathematical model
- linear programming
- constant factor approximation