Zobrazeno 1 - 10
of 24
pro vyhledávání: '"Soheil Behnezhad"'
Publikováno v:
Operations Research. 71:506-516
The Colonel Blotto game (initially introduced by Borel in 1921) is commonly used for analyzing a wide range of applications from the U.S.Ppresidential election to innovative technology competitions to advertising, sports, and politics. After around a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dd62bdb9661177bd985356e5027e74bb
https://doi.org/10.1287/opre.2022.2261
https://doi.org/10.1287/opre.2022.2261
Autor:
Soheil Behnezhad
Publikováno v:
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) ISBN: 9781611977554
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::575e570650ca27160e0a487a76e6c4ad
https://doi.org/10.1137/1.9781611977554.ch6
https://doi.org/10.1137/1.9781611977554.ch6
Publikováno v:
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) ISBN: 9781611977554
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::48db61f44df5f975b4a52e7d545959e4
https://doi.org/10.1137/1.9781611977554.ch33
https://doi.org/10.1137/1.9781611977554.ch33
Publikováno v:
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) ISBN: 9781611977554
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2b32621c59c48c2073e98ce2207b0470
https://doi.org/10.1137/1.9781611977554.ch151
https://doi.org/10.1137/1.9781611977554.ch151
Autor:
Soheil Behnezhad
We study the problem of estimating the size of maximum matching and minimum vertex cover in sublinear time. Denoting the number of vertices by $n$ and the average degree in the graph by $\bar{d}$, we obtain the following results for both problems: *
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4a66c715640cc32baf5e56a050cd10a3
Autor:
Mahsa Derakhshan, Soheil Behnezhad
Publikováno v:
FOCS
Let $G= (V, E)$ be a given edge-weighted graph and let its realization $\mathcal{G}$ be a random subgraph of $G$ that includes each edge $e\in E$ independently with probability $p$ . We study a stochastic matching problem where the goal is to non-ada
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4e2ec6015d2f379e18e91e63c6204a6b
https://doi.org/10.1109/focs46700.2020.00131
https://doi.org/10.1109/focs46700.2020.00131
Autor:
Jakub Lacki, Soheil Behnezhad, Laxman Dhulipala, Warren Schudy, Vahab Mirrokni, Hossein Esfandiari
Publikováno v:
VLDB Endowment
We study fundamental graph problems such as graph connectivity, minimum spanning forest (MSF), and approximate maximum (weight) matching in a distributed setting. In particular, we focus on the Adaptive Massively Parallel Computation (AMPC) model, wh
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::626f7dc02dd49f680c106ae2ea4bc017
http://arxiv.org/abs/2009.11552
http://arxiv.org/abs/2009.11552
Publikováno v:
STOC
Suppose that we are given an arbitrary graph G=(V, E) and know that each edge in E is going to be realized independently with some probability p. The goal in the stochastic matching problem is to pick a sparse subgraph Q of G such that the realized e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ab573730803e31406fbabd2ace15e249
https://doi.org/10.1145/3357713.3384340
https://doi.org/10.1145/3357713.3384340