175
click to vote
STACS
15 years 12 months ago
2007 Springer 
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...
183
Voted
STACS
15 years 12 months ago
2007 Springer 
In this paper, it is shown that the Feedback Vertex Set problem on unweighted, undirected graphs has a kernel of cubic size. I.e., a polynomial time algorithm is described, that, w...
138
Voted
STACS
15 years 12 months ago
2007 Springer 
We consider deducibility constraints, which are equivalent to particular Diophantine systems, arising in the automatic verification of security protocols, in presence of associati...
151
click to vote
STACS
15 years 12 months ago
2007 Springer
Abstract. The perfect matching problem is known to be in ¶, in randomized NC, and it is hard for NL. Whether the perfect matching problem is in NC is one of the most prominent ope...
149
click to vote
STACS
15 years 12 months ago
2007 Springer 
We present a (2 3 − o(1))-approximation algorithm for the partial latin square extension (PLSE) problem. This improves the current best bound of 1 − 1 e due to Gomes, Regis, an...
|
Theoretical Computer Science