A faster FPTAS for the subset-sums ratio problem

DOI10.1007/978-3-319-94776-1_50OpenAlexW3098642663MaRDI QIDQ1791024

Nikolaos Melissinos, Aris Pagourtzis

Publication date: 4 October 2018

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

zbMATH Keywords

combinatorial optimizationapproximation schemeknapsack problemssubset-sums ratio

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Dynamic programming (90C39) Approximation algorithms (68W25)

Related Items (4)

Approximation schemes for subset-sums ratio problems ⋮ Approximating subset sum ratio via subset sum computations ⋮ Faster algorithms for \(k\)-\textsc{Subset Sum} and variations ⋮ Faster algorithms for \(k\)-subset sum and variations

This page was built for publication: A faster FPTAS for the subset-sums ratio problem