Publications related to The (h, k)-Server Problem on Bounded Depth Trees

Asymptotically Optimal Contextual Bandit Algorithm Using Hierarchical Structures

We propose an online algorithm for sequential learning in the contextual multiarmed bandit setting. Our approach is to partition the context space and, then, optimally combine all of the possible mappings between the partition regions and the set of bandit ...

2019

Nested Convex Bodies are Chaseable

Marek Elias

In the Convex Body Chasing problem, we are given an initial point v0. Rd and an online sequence of n convex bodies F1,..., Fn. When we receive Ft, we are required to move inside Ft. Our goal is to minimize the total distance traveled. This fundamental onli ...

SPRINGER2019

Freight railway network design problem

Michel Bierlaire, Virginie Janine Camille Lurkin, Nikola Obrenovic

In freight railway networks, commodities are usually transported via hubs, which are called marshaling or shunting yards, depending on their capacity. Consequently, the number and locations of these yards effect the transport costs to a great extent. The ...

2018

Dynamic Facility Location via Exponential Clocks

Ola Nils Anders Svensson, Ashkan Norouzi Fard, Hyung Chan An

The dynamic facility location problem is a generalization of the classic facility location problem proposed by Eisenstat, Mathieu, and Schabanel to model the dynamics of evolving social/infrastructure networks. The generalization lies in that the distance ...

Association for Computing Machinery2017

LPN in Cryptography

Sonia Mihaela Bogos

The security of public-key cryptography relies on well-studied hard problems, problems for which we do not have efficient algorithms. Factorization and discrete logarithm are the two most known and used hard problems. Unfortunately, they can be easily solv ...

EPFL2017

Robust Submodular Maximization: A Non-Uniform Partitioning Approach

Volkan Cevher, Jonathan Mark Scarlett, Ilija Bogunovic, Slobodan Mitrovic

We study the problem of maximizing a monotone submodular function subject to a cardinality constraint

k

, with the added twist that a number of items

\tau

from the returned set may be removed. We focus on the worst-case setting considered in Orlin et al ...

2017

Centrality of trees for capacitated -center

Ola Nils Anders Svensson, Hyung Chan An, Aditya Bhaskara

We consider the capacitated -center problem. In this problem we are given a finite set of locations in a metric space and each location has an associated non-negative integer capacity. The goal is to choose (open) locations (called centers) and assign each ...

Springer Heidelberg2015

Evaluation of control strategies for fixed-wing drones following slow-moving ground agents

Dario Floreano, Jean-Christophe Zufferey, Grégoire Hilaire Marie Heitz, Maja Varga

There are many situations where fixed-wing drones may be required to track ground moving agents, such as humans or cars, which are typically slower than drones. Some control strategies have been proposed and validated in simulations using the average dista ...

Elsevier2015

Centrality of Trees for Capacitated k-Center

Ola Nils Anders Svensson, Hyung Chan An, Aditya Bhaskara

We consider the capacitated k-center problem. In this problem we are given a finite set of locations in a metric space and each location has an associated non-negative integer capacity. The goal is to choose (open) k locations (called centers) and assign e ...

Springer2014

Approximation theorems in metric spaces and functionals strictly subordinated to convergent series

Some new results are presented concerning the search and approximation of solutions of equations in metric spaces using functionals strictly subordinated to a convergent series and functionals compatible with a convergent series. These classes of functiona ...

Elsevier2014

The (h, k)-Server Problem on Bounded Depth Trees

Graph Chatbot

Chat with Graph Search

Asymptotically Optimal Contextual Bandit Algorithm Using Hierarchical Structures

Nested Convex Bodies are Chaseable

Freight railway network design problem

Dynamic Facility Location via Exponential Clocks

LPN in Cryptography

Robust Submodular Maximization: A Non-Uniform Partitioning Approach

Centrality of trees for capacitated -center

Evaluation of control strategies for fixed-wing drones following slow-moving ground agents

Centrality of Trees for Capacitated k-Center

Approximation theorems in metric spaces and functionals strictly subordinated to convergent series

Asymptotically Optimal Contextual Bandit Algorithm Using Hierarchical Structures

Nested Convex Bodies are Chaseable

Freight railway network design problem

Dynamic Facility Location via Exponential Clocks

Approximation theorems in metric spaces and functionals strictly subordinated to convergent series

Robust Submodular Maximization: A Non-Uniform Partitioning Approach

LPN in Cryptography

Centrality of trees for capacitated -center

Evaluation of control strategies for fixed-wing drones following slow-moving ground agents

Centrality of Trees for Capacitated k-Center