4 citations · 16 across the 32 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.DS2017
Almost Optimal Stochastic Weighted Matching With Few Queries
Soheil Behnezhad, Nima Reyhani
We consider the {\em stochastic matching} problem. An edge-weighted general (i.e., not necessarily bipartite) graph is given in the input, where each edge in is {\em…
cs.GT2017★ 1 cited
A Polynomial Time Algorithm for Spatio-Temporal Security Games
Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi +1
An ever-important issue is protecting infrastructure and other valuable targets from a range of threats from vandalism to theft to piracy to terrorism. The "defender" can rarely af…