Dividing splittable goods evenly and with limited fragmentation

DOI10.4230/LIPIcs.MFCS.2017.9zbMath1441.05209OpenAlexW2763656835MaRDI QIDQ5111223

Peter Damaschke

Publication date: 26 May 2020

Full work available at URL: https://doi.org/10.4230/LIPIcs.MFCS.2017.9

zbMATH Keywords

packingweighted graphload balancinglinear-time algorithmparameterized algorithm

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Trees (05C05) Searching and sorting (68P10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Signed and weighted graphs (05C22) Parameterized complexity, tractability and kernelization (68Q27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The proper relaxation and the proper gap of the skiving stock problem
• Time bounds for selection
• A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
• Exact and Approximate Algorithms for Scheduling Nonidentical Processors

This page was built for publication: Dividing splittable goods evenly and with limited fragmentation