FSTTCS
2009
Springer
13 years 11 months ago
2009
Springer
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) ...
FSTTCS
2009
Springer
13 years 11 months ago
2009
Springer
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...
FSTTCS
2009
Springer
13 years 11 months ago
2009
Springer
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...
FSTTCS
2009
Springer
13 years 11 months ago
2009
Springer
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...
FSTTCS
2009
Springer
13 years 11 months ago
2009
Springer
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...
FSTTCS
2009
Springer
13 years 11 months ago
2009
Springer
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...
FSTTCS
2009
Springer
13 years 11 months ago
2009
Springer
ABSTRACT. We present a simple exact algorithm for the INDEPENDENT SET problem with a run
FSTTCS
2009
Springer
13 years 11 months ago
2009
Springer
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...
FSTTCS
2009
Springer
13 years 11 months ago
2009
Springer
FSTTCS
2009
Springer
13 years 11 months ago
2009
Springer
ABSTRACT. We consider concurrent systems that can be modelled as 1-safe Petri nets communicating through a fixed set of buffers (modelled as unbounded places). We identify a param...