The \textsc{maximum zero-sum partition} problem

DOI10.1016/j.tcs.2024.114811MaRDI QIDQ6633570

Géraldine Jean, Oscar Fontaine, Stéphane Vialette, Guillaume Fertin

Publication date: 6 November 2024

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

zbMATH Keywords

partitionalgorithmic complexityinapproximabilityzero-sum\textsf{FPT}

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• An application of simultaneous diophantine approximation in combinatorial optimization
• Which problems have strongly exponential complexity?
• Bin packing with fixed number of bins revisited
• Integer Programming with a Fixed Number of Variables
• Complexity Theory
• Reducibility among Combinatorial Problems
• Parameterized Algorithms
• Bounding the Running Time of Algorithms for Scheduling and Packing Problems
• On the complexity of \(k\)-SAT

This page was built for publication: The \textsc{maximum zero-sum partition} problem