Locality-preserving allocations problems and coloured bin packing

DOI10.1016/j.tcs.2015.06.036zbMath1328.68308arXiv1508.03992OpenAlexW1904534799MaRDI QIDQ2355699

Andrew Twigg, Eduardo Candido Xavier

Publication date: 24 July 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1508.03992

zbMATH Keywords

approximation algorithmsbin packinglocality preserving allocations

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• New lower bounds for certain classes of bin packing algorithms
• Maximizing data locality in distributed systems
• Class constrained bin packing revisited
• Bin packing can be solved within 1+epsilon in linear time
• An improved lower bound for on-line bin packing algorithms
• The class constrained bin packing problem with applications to video-on-demand
• Colorful Bin Packing
• THE GRAPH-BIN PACKING PROBLEM
• Online Colored Bin Packing
• A simple on-line bin-packing algorithm
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
• Algorithms for non-uniform size data placement on parallel disks
• Bounded space on-line bin packing: Best is better than first

This page was built for publication: Locality-preserving allocations problems and coloured bin packing