Approximation Algorithms for Computing Certain Answers over Incomplete Databases.
Sergio GrecoCristian MolinaroIrina TrubitsynaPublished in: SEBD (2017)
Keyphrases
- approximation algorithms
- databases
- np hard
- special case
- worst case
- vertex cover
- minimum cost
- facility location problem
- network design problem
- primal dual
- set cover
- open shop
- approximation ratio
- constant factor
- approximation schemes
- randomized algorithms
- exact algorithms
- disjoint paths
- np hardness
- polynomial time approximation
- undirected graph
- constant factor approximation
- knapsack problem