Efficient approximation algorithms for the subset-sums equality problem.

DOI10.1006/jcss.2001.1784zbMath1078.90037OpenAlexW2053876898MaRDI QIDQ1608313

Zsolt Tuza, Cristina Bazgan, Miklos Santha

Publication date: 4 August 2002

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcss.2001.1784

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Integer programming (90C10) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items

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

Cites Work

• Unnamed Item
• On total functions, existence theorems and computational complexity
• On the equal-subset-sum problem
• On the complexity of the parity argument and other inefficient proofs of existence
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems