Computational aspects of ordered integer partitions with bounds

DOI10.1007/s00453-020-00713-7zbMath1455.68131OpenAlexW3023171154MaRDI QIDQ2006947

Dominik Köppl, Roland Glück

Publication date: 12 October 2020

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-020-00713-7

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Combinatorial aspects of partitions of integers (05A17) Combinatorics in computer science (68R05) Parallel algorithms in computer science (68W10) Data structures (68P05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A generalization of multiple choice balls-into-bins: tight bounds
• Balls in constrained urns and Cantor-like sets
• Faster algorithms for Frobenius numbers
• Johann Faulhaber and Sums of Powers
• Multi-Objective Combinatorial Optimization: Problematic and Context