/
An O(1) Approximation Algorithm for Generalized Min-Sum Set An O(1) Approximation Algorithm for Generalized Min-Sum Set

An O(1) Approximation Algorithm for Generalized Min-Sum Set - PowerPoint Presentation

test
test . @test
Follow
384 views
Uploaded On 2016-07-23

An O(1) Approximation Algorithm for Generalized Min-Sum Set - PPT Presentation

Ravishankar Krishnaswamy Carnegie Mellon University joint work with Nikhil Bansal IBM and Anupam Gupta CMU elgooG A Hypothetical Search Engine Given a search query Q Identify relevant webpages and order them ID: 417143

user time algorithm happy time user happy algorithm approximation log set elements users happiness min rounding cover gianteagle probability

Share:

Link:

Embed:

Download Presentation from below link

Download Presentation The PPT/PDF document "An O(1) Approximation Algorithm for Gene..." is the property of its rightful owner. Permission is granted to download and print the materials on this web site for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.


Presentation Transcript