44 citations · 50 across the 13 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.DS2013
Expected time complexity of the auction algorithm and the push relabel algorithm for maximal bipartite matching on random graphs
Oshri Naparstek, Amir Leshem
In this paper we analyze the expected time complexity of the auction algorithm for the matching problem on random bipartite graphs. We prove that the expected time complexity of th…
cs.DC2013★ 44 cited
Fully distributed optimal channel assignment for open spectrum access
Oshri Naparstek, Amir Leshem
In this paper we address the problem of fully distributed assignment of users to sub-bands such that the sum-rate of the system is maximized. We introduce a modified auction algori…