8 citations · 29 across the 15 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2013
Matching with our Eyes Closed
Gagan Goel, Pushkar Tripathi
Motivated by an application in kidney exchange, we study the following query-commit problem: we are given the set of vertices of a non-bipartite graph G. The set of edges in this g…
cs.DS2010★ 2 cited
Online Vertex-Weighted Bipartite Matching and Single-bid Budgeted Allocations
Gagan Aggarwal, Gagan Goel, Chinmay Karande +1
We study the following vertex-weighted online bipartite matching problem: is a bipartite graph. The vertices in have weights and are known ahead of time, while the…