Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

WAOA
2005
Springer

favoriteEmaildiscussreport

90views Algorithms» more WAOA 2005»

Approximation Schemes for Packing with Item Fragmentation

13 years 10 months ago

Approximation Schemes for Packing with Item Fragmentation

Download www.cs.technion.ac.il

Hadas Shachnai, Tami Tamir, Omer Yehezkely

Real-time Traffic

WAOA 2005 |

claim paper

Related Content

» Asymptotic fully polynomial approximation schemes for variants of openend bin packing

» Approximation Schemes for Packing Splittable Items with Cardinality Constraints

» A Dense Hierarchy of Sublinear Time Approximation Schemes for Bin Packing

» Better approximation algorithms for bin covering

» The Train Delivery Problem Vehicle Routing Meets Bin Packing

Post Info
More Details (n/a)

Added	28 Jun 2010
Updated	28 Jun 2010
Type	Conference
Year	2005
Where	WAOA
Authors	Hadas Shachnai, Tami Tamir, Omer Yehezkely

Comments (0)