ALGORITHMICA
2002
13 years 4 months ago
2002
A proper coloring of the edges of a graph G is called acyclic if there is no 2-colored cycle in G. The acyclic edge chromatic number of G, denoted by a (G), is the least number of...
ALGORITHMICA
2002
13 years 4 months ago
2002
ALGORITHMICA
2002
13 years 4 months ago
2002
Let S be a set of n points in a metric space, and k a positive integer. Algorithms are given that construct k-fault-tolerant spanners for S. If in such a spanner at most k vertice...
ALGORITHMICA
2002
13 years 4 months ago
2002
This paper answers the following question: Given an \erector set" linkage, a connected set of xed-length links, what is the minimal needed to adjust the edge lengths so that ...
ALGORITHMICA
2002
13 years 4 months ago
2002
The implementation of an algorithm is faced with the issues efficiency, flexibility, and ease-of-use. In this paper, we suggest a design concept that greatly increases the flexibi...
ALGORITHMICA
2002
13 years 4 months ago
2002
We consider a special case of the weighted caching problem where
ALGORITHMICA
2002
13 years 4 months ago
2002
We describe a quantum black-box network computing the majority of N bits with zerosided error using only 2 3 N + O( N log( -1 log N)) queries: the algorithm returns the correct an...
ALGORITHMICA
2002
13 years 4 months ago
2002
ALGORITHMICA
2002
13 years 4 months ago
2002
In this paper we introduce a generalization of Paging to the case where there are many threads of requests. This models situations in which the requests come from more than one ind...
ALGORITHMICA
2002
13 years 4 months ago
2002
Abstract. We consider the tasks of testing and spot-checking for data streams. These testers and spotcheckers are potentially useful in real-time or near real-time applications tha...