134
click to vote
COCOON
15 years 6 months ago
2006 Springer 
We consider the problem of reconciling gene trees with a species tree based on the widely accepted Gene Duplication model from Goodman et al. Current algorithms that solve this pro...
142
click to vote
COCOON
15 years 6 months ago
2006 Springer
We study the dynamic bin packing problem introduced by Coffman, Garey and Johnson. This problem is a generalization of the bin packing problem in which items may arrive and depart...
126
click to vote
COCOON
15 years 6 months ago
2006 Springer
In this paper we present approximation results for the class constrained bin packing problem that has applications to Video-on-Demand Systems. In this problem we are given bins of...
106
click to vote
COCOON
15 years 6 months ago
2006 Springer 
Abstract. A circular-arc model (C, A) is a circle C together with a collection A of arcs of C. If A satisfies the Helly Property then (C, A) is a Helly circular-arc model. A (Helly...
132
click to vote
COCOON
15 years 6 months ago
2006 Springer
Abstract. While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few stu...
|
Combinatorics