Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Liaee, Mehraneh"'
Autor:
Chrobak, Marek, Haney, Samuel, Liaee, Mehraneh, Panigrahi, Debmalya, Rajaraman, Rajmohan, Sundaram, Ravi, Young, Neal E.
It is natural to generalize the online $k$-Server problem by allowing each request to specify not only a point $p$, but also a subset $S$ of servers that may serve it. For uniform metrics, the problem is equivalent to a generalization of Paging in wh
Externí odkaz:
http://arxiv.org/abs/2206.05579
Autor:
Haney, Samuel, Liaee, Mehraneh, Maggs, Bruce M., Panigrahi, Debmalya, Rajaraman, Rajmohan, Sundaram, Ravi
We initiate the algorithmic study of retracting a graph into a cycle in the graph, which seeks a mapping of the graph vertices to the cycle vertices, so as to minimize the maximum stretch of any edge, subject to the constraint that the restriction of
Externí odkaz:
http://arxiv.org/abs/1904.11946
We study the problem of gossip in dynamic networks controlled by an adversary that can modify the network arbitrarily from one round to another, provided that the network is always connected. In the gossip problem, $n$ tokens are arbitrarily distribu
Externí odkaz:
http://arxiv.org/abs/1607.05645
Autor:
Chrobak, Marek1 (AUTHOR) marek@cs.ucr.edu, Haney, Samuel (AUTHOR), Liaee, Mehraneh (AUTHOR), Panigrahi, Debmalya (AUTHOR), Rajaraman, Rajmohan (AUTHOR), Sundaram, Ravi (AUTHOR), Young, Neal E. (AUTHOR)
Publikováno v:
Algorithmica. Oct2024, p1-43.