Efficient approximation algorithms for the subset-sums equality problem.

DOI10.1006/JCSS.2001.1784zbMATH Open1078.90037OpenAlexW2053876898MaRDI QIDQ1608313FDOQ1608313

Authors: Cristina Bazgan, Miklos Santha, Zsolt Tuza 

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

Recommendations

• scientific article; zbMATH DE number 1223719
• Two linear approximation algorithms for the subset-sum problem
• On the equal-subset-sum problem
• Simple FPTAS for the subset-sums ratio problem
• On the complexity of variations of equal sum subsets

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• On the complexity of the parity argument and other inefficient proofs of existence
• On total functions, existence theorems and computational complexity
• On the equal-subset-sum problem

Cited In (12)

• Faster algorithms for \(k\)-subset sum and variations
• On the equal-subset-sum problem
• Simple FPTAS for the subset-sums ratio problem
• Approximating subset sum ratio via subset sum computations
• Approximation schemes for subset-sums ratio problems
• Composing equipotent teams.
• A subquadratic approximation scheme for partition
• A faster FPTAS for the subset-sums ratio problem
• On the complexity of variations of equal sum subsets
• Faster algorithms for \(k\)-\textsc{Subset Sum} and variations
• Approximating subset sum ratio via partition computations
• Approximability of the Subset Sum Reconfiguration Problem

This page was built for publication: Efficient approximation algorithms for the subset-sums equality problem.

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