Sciweavers

Share
SIGECOM
2010
ACM

Fast algorithms for finding matchings in lopsided bipartite graphs with applications to display ads

9 years 2 months ago
Fast algorithms for finding matchings in lopsided bipartite graphs with applications to display ads
We derive efficient algorithms for both detecting and representing matchings in lopsided bipartite graphs; such graphs have so many nodes on one side that it is infeasible to represent them in memory or to identify matchings using standard approaches. Detecting and representing matchings in lopsided bipartite graphs is important for allocating and delivering guaranteed-placement display ads, where the corresponding bipartite graph of interest has nodes representing advertisers on one side and nodes representing web-page impressions on the other; real-world instances of such graphs can have billions of impression nodes. We provide theoretical guarantees for our algorithms, and in a real-world advertising application, we demonstrate the feasibility of our detection algorithms. Categories and Subject Descriptors
Denis Charles, Max Chickering, Nikhil R. Devanur,
Added 30 Jan 2011
Updated 30 Jan 2011
Type Journal
Year 2010
Where SIGECOM
Authors Denis Charles, Max Chickering, Nikhil R. Devanur, Kamal Jain, Manan Sanghi
Comments (0)
books