Approximation and Online Algorithms

DOI10.1007/11671411zbMATH Open1177.90352OpenAlexW4210634114MaRDI QIDQ5898484FDOQ5898484

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

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

Mathematics Subject Classification ID

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

Cited In (14)

• The bin packing problem with item fragmentation: a worst-case analysis
• Approximation schemes for packing splittable items with cardinality constraints
• Bin packing with restricted item fragmentation
• Analysis of transmissions scheduling with packet fragmentation
• Approximation Schemes for Packing Splittable Items with Cardinality Constraints
• Mathematical programming algorithms for bin packing problems with item fragmentation
• Matrix columns allocation problems
• Title not available (Why is that?)
• Bin packing with fragmentable items: presentation and approximations
• On Packing Splittable Items with Cardinality Constraints
• Fast Asymptotic FPTAS for Packing Fragmentable Items with Costs
• On lazy bin covering and packing problems
• The basic train makeup problem in shunting yards
• Approximation schemes for packing with 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)