scientific article; zbMATH DE number 7740931

DOI10.4230/LIPICS.ESA.2021.76MaRDI QIDQ6075974zbMATH OpenFDO

Authors

Publication date 20 September 2023

Full work available at URL https://arxiv.org/abs/2012.06062

zbMATH Keywords

data structuremodular subset sumsegment treestring problem

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(4)

• Minimizing tardy processing time on a single machine in near-linear time
• Minimizing tardy processing time on a single machine in near-linear time
• Almost optimum \(\ell \)-covering of \(\mathbb{Z}_n\)
• Does subset sum admit short proofs?

This page was built for publication:

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