scientific article; zbMATH DE number 7788445

DOI10.5555/3458064.3458171MaRDI QIDQ6147362zbMATH OpenFDO

Authors Karl Bringmann, Philip Wellnitz

Publication date 15 January 2024

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

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(5)

• Minimizing tardy processing time on a single machine in near-linear time
• Minimizing tardy processing time on a single machine in near-linear time
• Knapsack and subset sum with small items
• Parameterized algorithms on integer sets with small doubling: integer programming, subset sum and k-SUM
• 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 Q6147362)