Thumbnail
Access Restriction
Subscribed

Author NegrucxFeri, Cosmin Silvestru ♦ PacsoxFi, Mircea Bogdan ♦ Stanley, Barbara ♦ Stein, Clifford ♦ Strat, Cristian George
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©2011
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Computer programming, programs & data
Subject Keyword Flow ♦ Bipartite graph ♦ Preflow push ♦ Real-world
Abstract In this article, we present an experimental study of several maximum-flow algorithms in the context of unbalanced bipartite networks. Our experiments are motivated by a real-world problem of managing reservation-based inventory in Google content ad systems. We are interested in observing the performance of several push-relabel algorithms on our real-world datasets and also on some generated ones. Previous work suggested an important improvement for push-relabel algorithms on unbalanced bipartite networks: the two-edge push rule. We show how the two-edge push rule improves the running time. While no single algorithm dominates the results, we show there is one that has very robust performance in practice.
ISSN 10846654
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2008-11-01
Publisher Place New York
e-ISSN 10846654
Journal Journal of Experimental Algorithmics (JEA)
Volume Number 16
Page Count 25
Starting Page 3.1
Ending Page 3.25


Open content in new tab

   Open content in new tab
Source: ACM Digital Library