New Deterministic Approximation Algorithms for Fully Dynamic Matching.
Sayan BhattacharyaMonika HenzingerDanupon NanongkaiPublished in: CoRR (2016)
Keyphrases
- approximation algorithms
- randomized algorithms
- np hard
- special case
- network design problem
- minimum cost
- vertex cover
- worst case
- approximation guarantees
- exact algorithms
- facility location problem
- undirected graph
- constant factor approximation
- approximation schemes
- approximation ratio
- graph matching
- scheduling problem
- np hardness
- primal dual
- combinatorial auctions
- open shop
- disjoint paths
- set cover
- resource allocation
- lower bound
- search algorithm