Add to ORKGDynamic Storage Allocation is a problem concerned with storing items that each have weight and time restrictions. Approximate algorithms have been constructed through online coloring of interval graphs. We present a general-ization that uses online coloring of tolerance graphs. We utilize online-with-representation algorithms on tolerance graphs, which are online algorithms in which the corresponding tolerance representation of a vertex is also presented. We find linear bounds for the online-with-representation chromatic number of various classes of tolerance graphs and apply these results to a generalization of Dynamic Storage Allocation, giving us a polynomial time approximation algorithm with linear performance ratio
In this report, we look at the problem of packing a number of arrays in memory efficiently. This is ...
AbstractIn this article we consider the application of ideas from parameterized complexity, and topo...
Let G=(V,E) be a graph with vertex set V and edge set E. The graph coloring problem consists in assi...
Dynamic Storage Allocation is a problem concerned with storing items that each have weight and time ...
AbstractWe use an on-line algorithm for coloring interval graphs to construct a polynomial time appr...
. This paper is concerned with on-line storage allocation to processes in a dynamic environment. Thi...
In this paper we study a periodic allocation problem which is a generalization of the dynamic storag...
AbstractIn this paper we study a periodic allocation problem which is a generalization of the dynami...
In this paper we study a periodic allocation problem which is a generalization of the dynamic storag...
AbstractWe study online interval coloring problems with bandwidth. We are interested in some variant...
In this report, we look at the problem of packing a number of arrays in memory efficiently. This is ...
AbstractWe present an improved online algorithm for coloring interval graphs with bandwidth. This pr...
We analyze the adaptive coloring online problem for the upgrowing orders. We consider this problem a...
Abstract. In this article we introduce a new program that applies ideas from parameterized complexit...
Abstract. This paper analyzes different online algorithms for the problem of assigning weights to ed...
In this report, we look at the problem of packing a number of arrays in memory efficiently. This is ...
AbstractIn this article we consider the application of ideas from parameterized complexity, and topo...
Let G=(V,E) be a graph with vertex set V and edge set E. The graph coloring problem consists in assi...
Dynamic Storage Allocation is a problem concerned with storing items that each have weight and time ...
AbstractWe use an on-line algorithm for coloring interval graphs to construct a polynomial time appr...
. This paper is concerned with on-line storage allocation to processes in a dynamic environment. Thi...
In this paper we study a periodic allocation problem which is a generalization of the dynamic storag...
AbstractIn this paper we study a periodic allocation problem which is a generalization of the dynami...
In this paper we study a periodic allocation problem which is a generalization of the dynamic storag...
AbstractWe study online interval coloring problems with bandwidth. We are interested in some variant...
In this report, we look at the problem of packing a number of arrays in memory efficiently. This is ...
AbstractWe present an improved online algorithm for coloring interval graphs with bandwidth. This pr...
We analyze the adaptive coloring online problem for the upgrowing orders. We consider this problem a...
Abstract. In this article we introduce a new program that applies ideas from parameterized complexit...
Abstract. This paper analyzes different online algorithms for the problem of assigning weights to ed...
In this report, we look at the problem of packing a number of arrays in memory efficiently. This is ...
AbstractIn this article we consider the application of ideas from parameterized complexity, and topo...
Let G=(V,E) be a graph with vertex set V and edge set E. The graph coloring problem consists in assi...