1542 search results - page 26 / 309 » Kernelization of packing problems |
100
click to vote
IJCV
2007
15 years 1 months ago
2007
We derive a family of kernels on dynamical systems by applying the Binet-Cauchy theorem to trajectories of states. Our derivation provides a unifying framework for all kernels on d...
ISAAC
2007
Springer
15 years 7 months ago
2007
Springer
In an edge deletion problem one is asked to delete at most k edges from a given graph such that the resulting graph satisfies a certain property. In this work, we study four NP-co...
123
click to vote
CEC
2010
IEEE
15 years 2 months ago
2010
IEEE
Genetic programming approaches have previously been employed in the literature to evolve heuristics for various combinatorial optimisation problems. This paper presents a hyper-heu...
DM
2008
15 years 1 months ago
2008
We consider the problems of finding the maximum number of vertex-disjoint triangles (VTP) and edge-disjoint triangles (ETP) in a simple graph. Both problems are NP-hard. The algor...
ESA
2003
Springer
15 years 6 months ago
2003
Springer
We report on a project with a German car manufacturer. The task is to compute (approximate) solutions to a specific large-scale packing problem. Given a polyhedral model of a car ...