Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Sarkar, Sherry"'
Autor:
Braun, Alexander, Sarkar, Sherry
The secretary problem is one of the fundamental problems in online decision making; a tight competitive ratio for this problem of $1/\mathrm{e} \approx 0.368$ has been known since the 1960s. Much more recently, the study of algorithms with prediction
Externí odkaz:
http://arxiv.org/abs/2409.20460
Maintaining a maximum bipartite matching online while minimizing recourse/augmentations is a well studied problem, motivated by content delivery, job scheduling, and hashing. A breakthrough result of Bernstein, Holm, and Rotenberg (\emph{SODA 2018})
Externí odkaz:
http://arxiv.org/abs/2309.10214
We show how to round any half-integral solution to the subtour-elimination relaxation for the TSP, while losing a less-than-1.5 factor. Such a rounding algorithm was recently given by Karlin, Klein, and Oveis Gharan based on sampling from max-entropy
Externí odkaz:
http://arxiv.org/abs/2111.09290
Autor:
Sarkar, Sherry, Soberón, Pablo
Tverberg's theorem bounds the number of points $\mathbb{R}^d$ needed for the existence of a partition into $r$ parts whose convex hulls intersect. If the points are colored with $N$ colors, we seek partitions where each part has at most one point of
Externí odkaz:
http://arxiv.org/abs/2005.13495
We prove several exact quantitative versions of Helly's and Tverberg's theorems, which guarantee that a finite family of convex sets in $R^d$ has a large intersection. Our results characterize conditions that are sufficient for the intersection of a
Externí odkaz:
http://arxiv.org/abs/1908.04438
In this paper, we study a family of take-away games called $\alpha$-tag, parametrized by a real number $\alpha\ge 1$. We show that for any given $\alpha$, there is a half-open interval $I_\alpha$ containing $\alpha$ such that the set of losing positi
Externí odkaz:
http://arxiv.org/abs/1809.07749
Autor:
Sarkar, Sherry, Soberón, Pablo
Publikováno v:
In European Journal of Combinatorics June 2022 103
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
In Journal of Combinatorial Theory, Series A August 2021 182
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.