19 search results - page 1 / 4 » Approximating the Non-contiguous Multiple Organization Packi... |
IFIPTCS
2010
13 years 3 months ago
2010
We present in this paper a 5/2-approximation algorithm for scheduling rigid jobs on multi-organizations. For a given set of n jobs, the goal is to construct a schedule for N organi...
MOR
2006
13 years 5 months ago
2006
We study the multidimensional generalization of the classical Bin Packing problem: Given a collection of d-dimensional rectangles of specified sizes, the goal is to pack them into ...
FOCS
2004
IEEE
13 years 8 months ago
2004
IEEE
Given an undirected multigraph G and a subset of vertices S V (G), the STEINER TREE PACKING problem is to find a largest collection of edge-disjoint trees that each connects S. T...
COCOA
2009
Springer
13 years 8 months ago
2009
Springer
stract to be announcedPlenary session 09:00-10:00 Panos M, Pardalos, University of Florida, USA Tea Break 10:00-10:20 At the 1st floor 10:20-10:45 Polynomial Approximation Schemes ...
BMCBI
2004
13 years 4 months ago
2004
Background: Many current gene prediction methods use only one model to represent proteincoding regions in a genome, and so are less likely to predict the location of genes that ha...