Add to ORKGAbstract. This paper analyzes different online algorithms for the problem of assigning weights to edges in a fully-connected bipartite graph that minimizes the overall cost while satisfying constraints. Edges in this graph may disappear and reappear over time. Performance of these algorithms is measured using simulations. This paper also attempts to derandomize the randomized online algorithm for this problem.
In graph algorithms, many questions about a graph can be answered in time proportional to the size o...
Consider the on-line problem where a number of servers are ready to provide service to a set of cust...
Abstract. In this article we introduce a new program that applies ideas from parameterized complexit...
INTRODUCTION Dynamic graph algorithms are algorithms that maintain properties of a (possibly edgewe...
In this paper we present deterministic fully dynamic algorithms for maintaining several properties o...
This paper presents the first dynamic algorithm that maintains 2-edge connectivity in polylogarithmi...
This paper studies the problem of maintaining the 2-edge-connected components of a graph undergoing ...
Motivated by placement of jobs in physical machines, we introduce and analyze the problem of online ...
We consider the problem of maintaining a minimum spanning tree of a dynamically changing graph, subj...
Deterministic fully dynamic graph algorithms are presented for connectivity and minimum spanning for...
We study the power of randomization in the design of online graph coloring algorithms. No specific ...
This paper considers the problem of online graph colouring. An algorithm for vertex-colouring graphs...
We provide a new simpler approach to the on-line load balancing problem in the case of restricted as...
This paper is devoted to an online variant of the minimum spanning tree problem in randomly weighted...
Dynamic Storage Allocation is a problem concerned with storing items that each have weight and time ...
In graph algorithms, many questions about a graph can be answered in time proportional to the size o...
Consider the on-line problem where a number of servers are ready to provide service to a set of cust...
Abstract. In this article we introduce a new program that applies ideas from parameterized complexit...
INTRODUCTION Dynamic graph algorithms are algorithms that maintain properties of a (possibly edgewe...
In this paper we present deterministic fully dynamic algorithms for maintaining several properties o...
This paper presents the first dynamic algorithm that maintains 2-edge connectivity in polylogarithmi...
This paper studies the problem of maintaining the 2-edge-connected components of a graph undergoing ...
Motivated by placement of jobs in physical machines, we introduce and analyze the problem of online ...
We consider the problem of maintaining a minimum spanning tree of a dynamically changing graph, subj...
Deterministic fully dynamic graph algorithms are presented for connectivity and minimum spanning for...
We study the power of randomization in the design of online graph coloring algorithms. No specific ...
This paper considers the problem of online graph colouring. An algorithm for vertex-colouring graphs...
We provide a new simpler approach to the on-line load balancing problem in the case of restricted as...
This paper is devoted to an online variant of the minimum spanning tree problem in randomly weighted...
Dynamic Storage Allocation is a problem concerned with storing items that each have weight and time ...
In graph algorithms, many questions about a graph can be answered in time proportional to the size o...
Consider the on-line problem where a number of servers are ready to provide service to a set of cust...
Abstract. In this article we introduce a new program that applies ideas from parameterized complexit...