Fast algorithms for a large-scale file aggregation problem

DOI10.1007/S00224-026-10293-8MaRDI QIDQ7397040zbMATH OpenFDO

Authors Lifeng Guo, Changhong Lu, Qingjie Ye

Publication date 2026

Published in Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00224-026-10293-8

Mathematics Subject Classification ID

Computer science (68-XX) Operations research, mathematical programming (90-XX)

Cites work

• A class of simple stochastic online bin packing algorithms
• A simple on-line bin-packing algorithm
• A stochastic model of bin-packing
• An O(n) bin-packing algorithm for uniformly distributed data
• Average-case analysis of the modified harmonic algorithm
• Average-case analysis of the smart next fit algorithm
• Bin packing with discrete item sizes, part II: Tight bounds on First Fit
• Deep performance analysis of refined harmonic bin packing algorithm
• Fast algorithms for bin packing
• Handbook of combinatorial optimization. In 5 volumes
• scientific article; zbMATH DE number 3722129 (Why is no real title available?)
• scientific article; zbMATH DE number 52589 (Why is no real title available?)
• scientific article; zbMATH DE number 1178976 (Why is no real title available?)
• scientific article; zbMATH DE number 3323559 (Why is no real title available?)
• Matching Theorems and Empirical Discrepancy Computations using Majorizing Measures
• On-line bin packing in linear time
• Packings in two dimensions: Asymptotic average-case analysis of algorithms
• The average-case analysis of some on-line algorithms for bin packing
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms

This page was built for publication: Fast algorithms for a large-scale file aggregation problem

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