The \textsc{maximum zero-sum partition} problem

DOI10.1016/J.TCS.2024.114811MaRDI QIDQ6633570FDOQ6633570

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

Publication date: 6 November 2024

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

zbMATH Keywords

partitioninapproximabilityzero-sumalgorithmic complexity\textsf{FPT}

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Title not available (Why is that?)
• Reducibility among combinatorial problems
• Complexity Theory
• Which problems have strongly exponential complexity?
• Integer Programming with a Fixed Number of Variables
• Parameterized algorithms
• On the complexity of \(k\)-SAT
• Combinatorics of genome rearrangements.
• An application of simultaneous diophantine approximation in combinatorial optimization
• Bin packing with fixed number of bins revisited
• Bounding the running time of algorithms for scheduling and packing problems

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

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