3415 search results - page 251 / 683 » Lower bounds on kernelization |
181
click to vote
FOCS
2006
IEEE
16 years 22 days ago
2006
IEEE
A family of subsets C of [n] def = {1, . . . , n} is (r, t)exclusive if for every S ⊂ [n] of size at least n − r, there exist S1, . . . , St ∈ C with S = S1∪S2∪· · · ...
156
click to vote
FOCS
2005
IEEE
16 years 8 days ago
2005
IEEE
We consider the problem of storing a large file on a remote and unreliable server. To verify that the file has not been corrupted, a user could store a small private (randomized...
112
click to vote
ICC
2007
IEEE
16 years 1 months ago
2007
IEEE
— In this paper we analyze the operation of two scheduling algorithms, Class Based Queuing (CBQ) and Delay Bounded Hybrid Proportional Delay (DBHPD). We compare results obtained ...
208
click to vote
FAW
2007
Springer
16 years 25 days ago
2007
Springer
Abstract. Given a graph G and a nonnegative integer k, the NP-complete Induced Matching problem asks for an edge subset M such that M is a matching and no two edges of M are joined...
193
click to vote
IWPEC
2004
Springer
16 years 1 days ago
2004
Springer
The problem of packing k edge-disjoint triangles in a graph has been thoroughly studied both in the classical complexity and the approximation fields and it has a wide range of ap...