Sciweavers

2714 search results - page 38 / 543
» Approximation Schemes for Scheduling
Sort
View
IPL
2008
132views more  IPL 2008»
15 years 3 months ago
Asymptotic fully polynomial approximation schemes for variants of open-end bin packing
We consider three variants of the open-end bin packing problem. Such variants of bin packing allow the total size of items packed into a bin to exceed the capacity of a bin, provi...
Leah Epstein, Asaf Levin
MOR
2006
123views more  MOR 2006»
15 years 3 months ago
Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
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 ...
Nikhil Bansal, José R. Correa, Claire Kenyo...
SIAMCOMP
2008
77views more  SIAMCOMP 2008»
15 years 3 months ago
A Linear-Time Approximation Scheme for TSP in Undirected Planar Graphs with Edge-Weights
We give an algorithm requiring O(c1/2 n) time to find an -optimal traveling salesman tour in the shortest-path metric defined by an undirected planar graph with nonnegative edgele...
Philip N. Klein
TALG
2008
70views more  TALG 2008»
15 years 3 months ago
Approximation schemes for wireless networks
Tim Nieberg, Johann Hurink, Walter Kern