Approximating Subset Sum Ratio faster than Subset Sum

DOI10.1137/1.9781611977912.50MaRDI QIDQ6645405zbMATH OpenFDO

Authors Karl Bringmann

Publication date 28 November 2024

Full work available at URL https://doi.org/10.1137/1.9781611977912.50

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(1)

• Approximation schemes for k-subset sum ratio and k-way number partitioning ratio

This page was built for publication: Approximating Subset Sum Ratio faster than Subset Sum

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