Sciweavers

FSTTCS
2009
Springer
14 years 7 months ago
Approximating Fault-Tolerant Group-Steiner Problems
In this paper, we initiate the study of designing approximation algorithms for FaultTolerant Group-Steiner (FTGS) problems. The motivation is to protect the well-studied group-Ste...
Rohit Khandekar, Guy Kortsarz, Zeev Nutov
FSTTCS
2009
Springer
14 years 7 months ago
Subexponential Algorithms for Partial Cover Problems
Partial Cover problems are optimization versions of fundamental and well studied problems like Vertex Cover and Dominating Set. Here one is interested in covering (or dominating) ...
Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman...
FSTTCS
2009
Springer
14 years 7 months ago
Non-Local Box Complexity and Secure Function Evaluation
ABSTRACT. A non-local box is an abstract device into which Alice and Bob input bits x and y respectively and receive outputs a and b respectively, where a, b are uniformly distribu...
Marc Kaplan, Iordanis Kerenidis, Sophie Laplante, ...
FSTTCS
2009
Springer
14 years 7 months ago
Automata and temporal logic over arbitrary linear time
Linear temporal logic was introduced in order to reason about reactive systems. It is often considered with respect to infinite words, to specify the behaviour of long-running sys...
Julien Cristau
FSTTCS
2009
Springer
14 years 7 months ago
Iterative Methods in Combinatorial Optimization
We describe a simple iterative method for proving a variety of results in combinatorial optimization. It is inspired by Jain’s iterative rounding method (FOCS 1998) for designing...
R. Ravi
FSTTCS
2009
Springer
14 years 7 months ago
Algorithms for Message Ferrying on Mobile ad hoc Networks
ABSTRACT. Message Ferrying is a mobility assisted technique for working around the disconnectedness and sparsity of Mobile ad hoc networks. One of the important questions which ari...
Mostafa H. Ammar, Deeparnab Chakrabarty, Atish Das...
FSTTCS
2009
Springer
14 years 7 months ago
Domination Problems in Nowhere-Dense Classes
We investigate the parameterized complexity of generalisations and variations of the dominating set problem on classes of graphs that are nowhere dense. In particular, we show that...
Anuj Dawar, Stephan Kreutzer
FSTTCS
2009
Springer
14 years 7 months ago
A Fine-grained Analysis of a Simple Independent Set Algorithm
ABSTRACT. We present a simple exact algorithm for the INDEPENDENT SET problem with a run
Joachim Kneis, Alexander Langer, Peter Rossmanith
FSTTCS
2009
Springer
14 years 7 months ago
Randomness extractors -- applications and constructions
Randomness extractors are efficient algorithms which convert weak random sources into nearly perfect ones. While such purification of randomness was the original motivation for c...
Avi Wigderson