APPROX
2000
Springer
14 years 7 months ago
2000
Springer
APPROX
2000
Springer
14 years 7 months ago
2000
Springer
APPROX
2000
Springer
14 years 7 months ago
2000
Springer
In this paper, we derive bounds on performance guarantees of online algorithms for real-time preemptive scheduling of jobs with deadlines on K machines when jobs are characterized ...
APPROX
2000
Springer
14 years 7 months ago
2000
Springer
Given a graph (directed or undirected) with costs on the edges, and an integer k, we consider the problem of nding a k-node connected spanning subgraph of minimum cost. For the ge...
APPROX
2000
Springer
14 years 7 months ago
2000
Springer
We consider a fault tolerant version of the metric facility location problem in which every city, j, is required to be connected to rj facilities. We give the first non-trivial ap...
APPROX
2000
Springer
14 years 7 months ago
2000
Springer
Motivated by the problem of WDM routing in all–optical networks, we study the following NP–hard problem. We are given a directed binary tree T and a set R of directed paths on ...