A faster FPTAS for the subset-sums ratio problem

DOI10.1007/978-3-319-94776-1_50MaRDI QIDQ1791024zbMATH OpenOpenAlexFDO

Authors Nikolaos Melissinos, Aris Pagourtzis

Publication date 4 October 2018

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

zbMATH Keywords

approximation schemecombinatorial optimizationknapsack problemssubset-sums ratio

Mathematics Subject Classification ID

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

Recommendations

• Simple FPTAS for the subset-sums ratio problem
• A Fast Approximation Algorithm For The Subset-Sum Problem
• Efficient approximation algorithms for the subset-sums equality problem.
• A Fast Approximation Algorithm for the Subset-sum Problem
• Efficient approximation algorithms for the SUBSET-SUMS EQUALITY problem

Cited in

(9)

• Faster algorithms for \(k\)-subset sum and variations
• Approximation schemes for subset-sums ratio problems
• Approximating subset sum ratio via subset sum computations
• Simple FPTAS for the subset-sums ratio problem
• scientific article; zbMATH DE number 1545003 (Why is no real title available?)
• Faster Pseudopolynomial Time Algorithms for Subset Sum
• Faster algorithms for \(k\)-\textsc{Subset Sum} and variations
• Approximating subset sum ratio via partition computations
• Approximation schemes for k-subset sum ratio and k-way number partitioning ratio

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

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