Sciweavers

SIAMCOMP
2010
97views more  SIAMCOMP 2010»
13 years 5 months ago
Lower Bounds for Randomized Consensus under a Weak Adversary
This paper studies the inherent trade-off between termination probability and total step complexity of randomized consensus algorithms. It shows that for every integer k, the prob...
Hagit Attiya, Keren Censor-Hillel
SIAMCOMP
2010
135views more  SIAMCOMP 2010»
13 years 5 months ago
Intractability of Clique-Width Parameterizations
We show that Edge Dominating Set, Hamiltonian Cycle, and Graph Coloring are W[1]-hard parameterized by clique-width. It was an open problem, explicitly mentioned in several papers,...
Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtano...
SIAMCOMP
2010
88views more  SIAMCOMP 2010»
13 years 5 months ago
Hardness Amplification Proofs Require Majority
Hardness amplification is the fundamental task of converting a -hard function f : {0, 1}n {0, 1} into a (1/2 - )-hard function Amp(f), where f is -hard if small circuits fail to c...
Ronen Shaltiel, Emanuele Viola
SIAMCOMP
2010
104views more  SIAMCOMP 2010»
13 years 5 months ago
Server Scheduling to Balance Priorities, Fairness, and Average Quality of Service
Often server systems do not implement the best known algorithms for optimizing average Quality of Service (QoS) out of concern of that these algorithms may be insufficiently fair ...
Nikhil Bansal, Kirk Pruhs
SIAMCOMP
2010
64views more  SIAMCOMP 2010»
13 years 5 months ago
Preprocessing Imprecise Points and Splitting Triangulations
Marc J. van Kreveld, Maarten Löffler, Joseph ...
SIAMCOMP
2010
172views more  SIAMCOMP 2010»
13 years 5 months ago
More Algorithms for All-Pairs Shortest Paths in Weighted Graphs
In the first part of the paper, we reexamine the all-pairs shortest paths (APSP) problem and present a new algorithm with running time O(n3 log3 log n/ log2 n), which improves all...
Timothy M. Chan
SIAMCOMP
2010
125views more  SIAMCOMP 2010»
13 years 5 months ago
Approximating Steiner Networks with Node-Weights
The (undirected) Steiner Network problem is: given a graph = ( , ) with edge/node-weights and edge-connectivity requirements { ( , ) : , }, find a minimumweight subgraph of conta...
Zeev Nutov
SIAMCOMP
2010
172views more  SIAMCOMP 2010»
13 years 5 months ago
Deterministic Polynomial Time Algorithms for Matrix Completion Problems
We present new deterministic algorithms for several cases of the maximum rank matrix completion problem (for short matrix completion), i.e. the problem of assigning values to the ...
Gábor Ivanyos, Marek Karpinski, Nitin Saxen...
SIAMCOMP
2010
93views more  SIAMCOMP 2010»
13 years 5 months ago
Tightening Nonsimple Paths and Cycles on Surfaces
We describe algorithms to compute the shortest path homotopic to a given path, or the shortest cycle freely homotopic to a given cycle, on an orientable combinatorial surface. Unli...
Éric Colin de Verdière, Jeff Erickso...
SIAMCOMP
2010
109views more  SIAMCOMP 2010»
13 years 5 months ago
Analysis of Delays Caused by Local Synchronization
Synchronization is often necessary in parallel computing, but it can create delays whenever the receiving processor is idle, waiting for the information to arrive. This is especia...
Julia Lipman, Quentin F. Stout