Add to ORKGIn the leasing optimization model, resources are leased for K different time periods, instead of being acquired for unlimited duration. The goal is to use these temporary resources to maintain a dynamic infrastructure that serves n requests while minimizing the total cost. We propose and study leasing variants of some network design problems. Currently we have an algorithm for the Online Connected Facility Leasing problem which is O(K lg n)-competitive if the scaling factor M = 1, and a O(lg K lg |V |)-competitive algorithm for the Online Steiner Network Leasing problem
The online (uniform) buy-at-bulk network design problem asks us to design a network, where the edge-...
In this paper we propose the Online Connected Facility Location problem (OCFL), which is an online v...
Abstract To meet the ever growing need for wireless spectrum, the Federal Communication Commision (F...
In the leasing optimization model, resources are leased for K different time periods, instead of bei...
We study leasing variants of the connected facility location problem, in which we wish to connect a ...
Consider the following Steiner Tree leasing problem. Given a graph G = (V,E) with root r, and a seq...
The Connected Facility Location (CFL) is a network design problem that arises from a combination of ...
Abstract. Consider the following Steiner Tree leasing problem. Given a graph G = (V, E) with root r,...
Abstract. We integrate probability distribution into pure competitive analysis to improve the perfor...
We study a few online and offline facility location and network design problems, including an offlin...
We study a wide range of online graph and network optimization problems, focusing on problems that a...
The Generalized Steiner Tree (GST) problem is defined as follows. We are given a graph with non-nega...
. We survey results on online versions of the standard network optimization problems, including the ...
In the multicommodity rent-or-buy (MROB) network design problem we are given a network together with...
In this paper, we study a very general type of online network design problem, and generalize two dif...
The online (uniform) buy-at-bulk network design problem asks us to design a network, where the edge-...
In this paper we propose the Online Connected Facility Location problem (OCFL), which is an online v...
Abstract To meet the ever growing need for wireless spectrum, the Federal Communication Commision (F...
In the leasing optimization model, resources are leased for K different time periods, instead of bei...
We study leasing variants of the connected facility location problem, in which we wish to connect a ...
Consider the following Steiner Tree leasing problem. Given a graph G = (V,E) with root r, and a seq...
The Connected Facility Location (CFL) is a network design problem that arises from a combination of ...
Abstract. Consider the following Steiner Tree leasing problem. Given a graph G = (V, E) with root r,...
Abstract. We integrate probability distribution into pure competitive analysis to improve the perfor...
We study a few online and offline facility location and network design problems, including an offlin...
We study a wide range of online graph and network optimization problems, focusing on problems that a...
The Generalized Steiner Tree (GST) problem is defined as follows. We are given a graph with non-nega...
. We survey results on online versions of the standard network optimization problems, including the ...
In the multicommodity rent-or-buy (MROB) network design problem we are given a network together with...
In this paper, we study a very general type of online network design problem, and generalize two dif...
The online (uniform) buy-at-bulk network design problem asks us to design a network, where the edge-...
In this paper we propose the Online Connected Facility Location problem (OCFL), which is an online v...
Abstract To meet the ever growing need for wireless spectrum, the Federal Communication Commision (F...