Sciweavers

COCOON
2006
Springer
15 years 21 days ago
Reconciling Gene Trees with Apparent Polytomies
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...
Wen-Chieh Chang 0002, Oliver Eulenstein
COCOON
2006
Springer
15 years 21 days ago
On Dynamic Bin Packing: An Improved Lower Bound and Resource Augmentation Analysis
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...
Wun-Tat Chan, Prudence W. H. Wong, Fencol C. C. Yu...
COCOON
2006
Springer
15 years 21 days ago
The Class Constrained Bin Packing Problem with Applications to Video-on-Demand
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...
E. C. Xavier, Flávio Keidi Miyazawa
COCOON
2006
Springer
15 years 21 days ago
Characterizations and Linear Time Recognition of Helly Circular-Arc Graphs
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...
Min Chih Lin, Jayme Luiz Szwarcfiter
COCOON
2006
Springer
15 years 21 days ago
Approximating Min-Max (Regret) Versions of Some Polynomial Problems
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...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...
Combinatorics
Top of PageReset Settings