Zobrazeno 1 - 10
of 42
pro vyhledávání: '"Argue, C."'
We study the problem of solving Packing Integer Programs (PIPs) in the online setting, where columns in $[0,1]^d$ of the constraint matrix are revealed sequentially, and the goal is to pick a subset of the columns that sum to at most $B$ in each coor
Externí odkaz:
http://arxiv.org/abs/2112.12920
The current best algorithms for convex body chasing problem in online algorithms use the notion of the Steiner point of a convex set. In particular, the algorithm which always moves to the Steiner point of the request set is $O(d)$ competitive for ne
Externí odkaz:
http://arxiv.org/abs/2104.07487
A closed convex conic subset $\mathcal{S}$ of the positive semidefinite (PSD) cone is rank-one generated (ROG) if all of its extreme rays are generated by rank-one matrices. The ROG property of $\mathcal{S}$ is closely related to the exactness of SDP
Externí odkaz:
http://arxiv.org/abs/2007.07433
We consider the problem of chasing convex functions, where functions arrive over time. The player takes actions after seeing the function, and the goal is to achieve a small function cost for these actions, as well as a small cost for moving between
Externí odkaz:
http://arxiv.org/abs/2005.14058
We study the problem of chasing convex bodies online: given a sequence of convex bodies $K_t\subseteq \mathbb{R}^d$ the algorithm must respond with points $x_t\in K_t$ in an online fashion (i.e., $x_t$ is chosen before $K_{t+1}$ is revealed). The obj
Externí odkaz:
http://arxiv.org/abs/1905.11877
Friedman and Linial introduced the convex body chasing problem to explore the interplay between geometry and competitive ratio in metrical task systems. In convex body chasing, at each time step $t \in \mathbb{N}$, the online algorithm receives a req
Externí odkaz:
http://arxiv.org/abs/1806.08865
Autor:
ARGUE, C. J.1 cargue@andrew.cmu.edu, GUPTA, ANUPAM1 anupamg@cs.cmu.edu, ZIYE TANG1 ziyet@andrew.cmu.edu, GURUGANESH, GURU gurug@google.com
Publikováno v:
Journal of the ACM. Sep2021, Vol. 68 Issue 5, p1-10. 10p.
Autor:
Aharoni, Ron, Argue, C. J.
Given an integer $r$ and a vector $\vec{a}=(a_1, \ldots ,a_p)$ of positive numbers with $\sum_{i \le p} a_i=r$, an $r$-uniform hypergraph $H$ is said to be $\vec{a}$-partitioned if $V(H)=\bigcup_{i \le p}V_i$, where the sets $V_i$ are disjoint, and $
Externí odkaz:
http://arxiv.org/abs/1412.3067
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.
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.