9 search results - page 2 / 2 » approx 2000 |
APPROX
2000
Springer
13 years 10 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
13 years 10 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
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. Combinatorial property testing deals with the following relaxation of decision problems: Given a fixed property and an input x, one wants to decide whether x satisfies th...
TCC
2007
Springer
13 years 12 months ago
2007
Springer
Private approximation of search problems deals with finding approximate solutions to search problems while disclosing as little information as possible. The focus of this work is ...