WDAG
2005
Springer
14 years 5 months ago
2005
Springer
WDAG
2005
Springer
14 years 5 months ago
2005
Springer
Abstract. Allowing read operations to return stale data with low probability has been proposed as a means to increase availability in quorums systems. Existing solutions that allow...
WDAG
2005
Springer
14 years 5 months ago
2005
Springer
Abstract. We consider the problem of overcoming (Distributed) Denial of Service (DoS) attacks by realistic adversaries that can eavesdrop on messages, or parts thereof, but with so...
WDAG
2005
Springer
14 years 5 months ago
2005
Springer
We study greedy routing over n nodes placed in a ring, with the distance between two nodes defined to be the clockwise or the absolute distance between them along the ring. Such ...
WDAG
2005
Springer
14 years 5 months ago
2005
Springer
WDAG
2005
Springer
14 years 5 months ago
2005
Springer
We analyze the problem of efficient distributed storage of information in a message-passing environment where both less than one third of the servers, as well as an arbitrary num...
WADS
2005
Springer
14 years 5 months ago
2005
Springer
An instance of the multi-radius cover problem consists of a graph G = (V, E) with edge lengths l : E → R+ . Each vertex u ∈ V represents a transmission station for which a tra...
WADS
2005
Springer
14 years 5 months ago
2005
Springer
We present efficient approximation algorithms for a number of problems that call for computing the prices that maximize the revenue of the seller on a set of items. Algorithms for ...
WADS
2005
Springer
14 years 5 months ago
2005
Springer
Important generalizations of the Vertex Cover problem (Connected Vertex Cover, Capacitated Vertex Cover, and Maximum Partial Vertex Cover) have been intensively studied in terms of...
WADS
2005
Springer
14 years 5 months ago
2005
Springer
Abstract. Settling a ten years open question, we show that the NPcomplete Feedback Vertex Set problem is deterministically solvable in O(ck ·m) time, where m denotes the number of...