21 citations · 31 across the 4 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2013★ 10 cited
Greedy Online Bipartite Matching on Random Graphs
Andrew Mastin, Patrick Jaillet
We study the average performance of online greedy matching algorithms on , the random bipartite graph with vertices on each side and edges occurring independently wit…
cs.DS2013
Average-Case Performance of Rollout Algorithms for Knapsack Problems
Andrew Mastin, Patrick Jaillet
Rollout algorithms have demonstrated excellent performance on a variety of dynamic and discrete optimization problems. Interpreted as an approximate dynamic programming algorithm,…