Cardinality of relations and relational approximation algorithms.
Rudolf BerghammerPeter HöfnerInsa StuckePublished in: J. Log. Algebraic Methods Program. (2016)
Keyphrases
- approximation algorithms
- np hard
- special case
- vertex cover
- worst case
- facility location problem
- minimum cost
- open shop
- primal dual
- relational databases
- approximation ratio
- network design problem
- precedence constraints
- exact algorithms
- relational data
- cardinality constraints
- disjoint paths
- set cover
- constant factor
- constant factor approximation
- undirected graph
- np hardness
- randomized algorithms
- scheduling problem
- data model
- approximation guarantees
- approximation schemes
- search space
- lower bound