FSTTCS
2009
Springer
14 years 4 months ago
2009
Springer
ABSTRACT. Church's Problem asks for the construction of a procedure which, given a logical specification on sequence pairs, realizes for any input sequence I an output sequen...
FSTTCS
2009
Springer
14 years 5 months ago
2009
Springer
FSTTCS
2009
Springer
14 years 5 months ago
2009
Springer
We introduce a graph clustering problem motivated by a stream processing application. Input to our problem is an undirected graph with vertex and edge weights. A cluster is a subse...
FSTTCS
2009
Springer
14 years 7 months ago
2009
Springer
FSTTCS
2009
Springer
14 years 7 months ago
2009
Springer
FSTTCS
2009
Springer
14 years 7 months ago
2009
Springer
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...
FSTTCS
2009
Springer
14 years 7 months ago
2009
Springer
A tournament T = (V, A) is a directed graph in which there is exactly one arc between every pair of distinct vertices. Given a digraph on n vertices and an integer parameter k, th...
FSTTCS
2009
Springer
14 years 7 months ago
2009
Springer
FSTTCS
2009
Springer
14 years 7 months ago
2009
Springer
FSTTCS
2009
Springer
14 years 7 months ago
2009
Springer
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...