Approximation Algorithms for the Maximum Carpool Matching Problem.
Gilad KutielPublished in: CoRR (2016)
Keyphrases
- approximation algorithms
- np hard
- worst case
- special case
- vertex cover
- minimum cost
- network design problem
- open shop
- exact algorithms
- approximation ratio
- facility location problem
- set cover
- primal dual
- constant factor
- np hardness
- approximation schemes
- randomized algorithms
- precedence constraints
- undirected graph
- disjoint paths
- integrality gap
- graph matching
- objective function
- polynomial time approximation
- approximation guarantees
- linear programming
- genetic algorithm