Reducing Redundant Information in Search Results Employing Approximation Algorithms.
Christos MakrisYannis PlegasYannis C. StamatiouElias C. StavropoulosAthanasios K. TsakalidisPublished in: DEXA (2) (2014)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- minimum cost
- facility location problem
- vertex cover
- constant factor
- np hardness
- set cover
- network design problem
- exact algorithms
- open shop
- lower bound
- undirected graph
- disjoint paths
- approximation ratio
- approximation schemes
- constant factor approximation
- multistage
- approximation guarantees
- upper bound