55 search results - page 8 / 11 » A class of perfectly contractile graphs |
FCT
2007
Springer
13 years 11 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...
ACTA
2008
13 years 7 months ago
2008
We study the two-dimensional version of the bin packing problem with conflicts. We are given a set of (two-dimensional) squares V = {1, 2, . . . , n} with sides s1, s2 . . . , sn ...
ISAAC
2007
Springer
14 years 1 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...
STACS
2010
Springer
14 years 2 months ago
2010
Springer
Reachability and shortest path problems are NL-complete for general graphs. They are known to be in L for graphs of tree-width 2 [14]. However, for graphs of treewidth larger than ...
WG
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...