Approximation Algorithms for Diversified Search Ranking.
Nikhil BansalKamal JainAnna KazeykinaJoseph NaorPublished in: ICALP (2) (2010)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- constant factor
- vertex cover
- open shop
- minimum cost
- search algorithm
- approximation ratio
- network design problem
- primal dual
- precedence constraints
- set cover
- facility location problem
- web search
- approximation schemes
- search space
- combinatorial auctions
- solution space
- undirected graph
- np hardness
- ranking algorithm
- randomized algorithms
- polynomial time approximation
- learning algorithm