1542 search results - page 2 / 309 » Kernelization of packing problems |
IWPEC
2004
Springer
13 years 11 months 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...
FOCS
2009
IEEE
14 years 1 months ago
2009
IEEE
Polynomial time preprocessing to reduce instance size is one of the most commonly deployed heuristics to tackle computationally hard problems. In a parameterized problem, every in...
SIU
2002
13 years 5 months ago
2002
Abstract. In order to verify and test the performance of new packing algorithms relative to existing algorithms, test problems are needed. The scope of published test instances for...
ESA
2009
Springer
14 years 25 days ago
2009
Springer
In this paper, we give evidence for the problems Disjoint Cycles and Disjoint Paths that they cannot be preprocessed in polynomial time such that resulting instances always have a ...
ACL
2010
13 years 4 months ago
2010
This paper proposes a convolution forest kernel to effectively explore rich structured features embedded in a packed parse forest. As opposed to the convolution tree kernel, the p...