The hardness and approximation algorithms for l-diversity.
Xiaokui XiaoKe YiYufei TaoPublished in: EDBT (2010)
Keyphrases
- approximation algorithms
- np hard
- np hardness
- worst case
- special case
- vertex cover
- minimum cost
- facility location problem
- lower bound
- approximation ratio
- network design problem
- primal dual
- scheduling problem
- open shop
- phase transition
- np complete
- set cover
- computational complexity
- exact algorithms
- undirected graph
- integer programming
- randomized algorithms
- polynomial time approximation
- precedence constraints
- network flow
- combinatorial auctions
- constant factor
- approximation guarantees
- branch and bound algorithm
- genetic algorithm
- disjoint paths