246 search results - page 3 / 50 » A Constant Factor Approximation Algorithm for Fault-Tolerant... |
WADS
2007
Springer
13 years 11 months ago
2007
Springer
An approach for reducing the navigation effort for the users of a web site is to enhance its hyperlink structure with additional hotlinks. We address the task of adding at most on...
APPROX
2006
Springer
13 years 8 months ago
2006
Springer
For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph...
TALG
2010
12 years 11 months ago
2010
We initiate the study of error confinement in distributed applications, where the goal is that only nodes that were directly hit by a fault may deviate from their correct external...
APPROX
2010
Springer
13 years 6 months ago
2010
Springer
We present a simple factor 6 algorithm for approximating the optimal multiplicative distortion of embedding (unweighted) graph metrics into tree metrics (thus improving and simplif...
PODS
2003
ACM
14 years 5 months ago
2003
ACM
The sliding window model is useful for discounting stale data in data stream applications. In this model, data elements arrive continually and only the most recent N elements are ...