1 citations · 2 across the 6 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
cs.DS2017
Nested Convex Bodies are Chaseable
Nikhil Bansal, Martin Böhm, Marek Eliáš +2
In the Convex Body Chasing problem, we are given an initial point in and an online sequence of convex bodies . When we receive , we are required…
cs.DS2017★ 1 cited
Competitive Algorithms for Generalized k-Server in Uniform Metrics
Nikhil Bansal, Marek Elias, Grigorios Koumoutsos +1
The generalized k-server problem is a far-reaching extension of the k-server problem with several applications. Here, each server lies in its own metric space . A reques…
cs.DS2017★ 1 cited
Weighted k-Server Bounds via Combinatorial Dichotomies
Nikhil Bansal, Marek Elias, Grigorios Koumoutsos
The weighted -server problem is a natural generalization of the -server problem where each server has a different weight. We consider the problem on uniform metrics, which co…