Approximation Algorithms for the Maximum Carpool Matching Problem.
Gilad KutielPublished in: CSR (2017)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- vertex cover
- facility location problem
- minimum cost
- approximation ratio
- set cover
- approximation schemes
- randomized algorithms
- network design problem
- primal dual
- np hardness
- constant factor
- open shop
- optimal solution
- exact algorithms
- integrality gap
- constant factor approximation
- disjoint paths
- dynamic programming