Approximation and Online Algorithms

DOI10.1007/11671411MaRDI QIDQ5898484zbMATH OpenOpenAlexFDO

Authors Hadas Shachnai, Tami Tamir, Omer Yehezkely

Publication date 12 February 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11671411

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25)

Recommendations

• Approximation schemes for packing with item fragmentation
• Fast Asymptotic FPTAS for Packing Fragmentable Items with Costs
• scientific article; zbMATH DE number 1830744
• Analysis of transmissions scheduling with packet fragmentation
• Bin packing with fragmentable items: presentation and approximations

Cited in

(14)

• On lazy bin covering and packing problems
• Approximation schemes for packing with item fragmentation
• Bin packing with fragmentable items: presentation and approximations
• Approximation Schemes for Packing Splittable Items with Cardinality Constraints
• On Packing Splittable Items with Cardinality Constraints
• Matrix columns allocation problems
• The bin packing problem with item fragmentation: a worst-case analysis
• Approximation schemes for packing splittable items with cardinality constraints
• Analysis of transmissions scheduling with packet fragmentation
• scientific article; zbMATH DE number 1830744 (Why is no real title available?)
• Mathematical programming algorithms for bin packing problems with item fragmentation
• The basic train makeup problem in shunting yards
• Fast Asymptotic FPTAS for Packing Fragmentable Items with Costs
• Bin packing with restricted item fragmentation

This page was built for publication: Approximation and Online Algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5898484)