New deterministic approximation algorithms for fully dynamic matching.
Sayan BhattacharyaMonika HenzingerDanupon NanongkaiPublished in: STOC (2016)
Keyphrases
- approximation algorithms
- randomized algorithms
- np hard
- special case
- worst case
- minimum cost
- vertex cover
- primal dual
- network design problem
- constant factor
- approximation guarantees
- open shop
- facility location problem
- exact algorithms
- undirected graph
- approximation ratio
- precedence constraints
- combinatorial auctions
- genetic algorithm