This paper presents the first polylogarithmic-competitive online algorithms for two-metric network design problems. These problems arise naturally in the design of computer networks (wired and wireless) as well as many other applications. In most cases the natural applications involve changing sets of communicating nodes, making the online model essential for addressing them
This chapter presents an introduction to the competitive analysis of online algorithms. In an online...
This thesis presents linear and convex programming based algorithms for NP-hard discrete optimizatio...
the supervisor, Adi Rosén, is not fluent enough in French. Le contexte général In online computat...
In this paper, we study a very general type of online network design problem, and generalize two dif...
We study a wide range of online graph and network optimization problems, focusing on problems that a...
Suppose the vertices of a complete weighted graph are revealed to us one at a time, and we have to b...
We give a principled method to design online algorithms (for potentially non-linear problems) using ...
Our final two lectures bring together multiple themes of the course to reason about a couple of new ...
We introduce and study online versions of weighted matching problems in metric spaces. We present a ...
The online (uniform) buy-at-bulk network design problem asks us to design a network, where the edge-...
. We survey results on online versions of the standard network optimization problems, including the ...
We consider on-line network synthesis problems. Let N = {1, · · · , n} be a set of n sites. Traff...
Many interesting theoretical problems arise from computer networks. In this thesis we will consider ...
Abstract. We consider the online metric matching problem. In this problem, we are given a graph with...
We study the problem of online call admission and routing (\call control") on general netwo...
This chapter presents an introduction to the competitive analysis of online algorithms. In an online...
This thesis presents linear and convex programming based algorithms for NP-hard discrete optimizatio...
the supervisor, Adi Rosén, is not fluent enough in French. Le contexte général In online computat...
In this paper, we study a very general type of online network design problem, and generalize two dif...
We study a wide range of online graph and network optimization problems, focusing on problems that a...
Suppose the vertices of a complete weighted graph are revealed to us one at a time, and we have to b...
We give a principled method to design online algorithms (for potentially non-linear problems) using ...
Our final two lectures bring together multiple themes of the course to reason about a couple of new ...
We introduce and study online versions of weighted matching problems in metric spaces. We present a ...
The online (uniform) buy-at-bulk network design problem asks us to design a network, where the edge-...
. We survey results on online versions of the standard network optimization problems, including the ...
We consider on-line network synthesis problems. Let N = {1, · · · , n} be a set of n sites. Traff...
Many interesting theoretical problems arise from computer networks. In this thesis we will consider ...
Abstract. We consider the online metric matching problem. In this problem, we are given a graph with...
We study the problem of online call admission and routing (\call control") on general netwo...
This chapter presents an introduction to the competitive analysis of online algorithms. In an online...
This thesis presents linear and convex programming based algorithms for NP-hard discrete optimizatio...
the supervisor, Adi Rosén, is not fluent enough in French. Le contexte général In online computat...
DOI
Add to ORKG