176 search results - page 2 / 36 » A Problem Kernelization for Graph Packing |
ISAAC
2009
Springer
13 years 9 months ago
2009
Springer
An induced packing of odd cycles in a graph is a packing such that there is no edge in a graph between any two odd cycles in the packing. We prove that the problem is solvable in t...
FOCS
2009
IEEE
13 years 12 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...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
We consider the following "multiway cut packing" problem in undirected graphs: we are given a graph G = (V, E) and k commodities, each corresponding to a set of terminal...
COMBINATORICS
2006
13 years 5 months ago
2006
We expose a relationship between jamming and a generalization of Tutte's barycentric embedding. This provides a basis for the systematic treatment of jamming and maximal packi...
FCT
2007
Springer
13 years 9 months ago
2007
Springer
We study the multi-dimensional version of the bin packing problem with conflicts. We are given a set of squares V = {1, 2, . . . , n} with sides s1, s2, . . . , sn [0, 1] and a co...