Approximation algorithms for data management in networks.
Christof KrickHarald RäckeMatthias WestermannPublished in: SPAA (2001)
Keyphrases
- approximation algorithms
- data management
- np hard
- special case
- vertex cover
- worst case
- network design problem
- approximation ratio
- randomized algorithms
- primal dual
- set cover
- database systems
- np hardness
- constant factor
- facility location problem
- minimum cost
- lower bound
- databases
- constant factor approximation
- network structure
- data warehouse
- upper bound
- query processing
- network design
- undirected graph
- combinatorial auctions
- knapsack problem
- linear programming
- polynomial time approximation
- open shop
- database