Efficient approximation algorithms for the SUBSET-SUMS EQUALITY problem

DOI10.1007/BFB0055069MaRDI QIDQ4219034zbMATH OpenFDO

Authors Miklos Santha, Zsolt Tuza, Cristina Bazgan

Publication date 15 November 1998

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0055069

zbMATH Keywords

fully polynomial-time approximation schemetwo nonempty disjoint subsets

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Efficient approximation algorithms for the subset-sums equality problem.
• On the equal-subset-sum problem
• A polynomial approximation scheme for the subset sum problem
• On the complexity of variations of equal sum subsets

Cited in

(13)

• On the equal-subset-sum problem
• Efficient approximation algorithms for the subset-sums equality problem.
• A faster FPTAS for the subset-sums ratio problem
• Approximation schemes for subset-sums ratio problems
• Constant time approximation scheme for largest well predicted subset
• On the hardness of finding subsets with equal average
• Simple FPTAS for the subset-sums ratio problem
• Approximability of the Subset Sum Reconfiguration Problem
• On the complexity of variations of equal sum subsets
• Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods
• Faster Pseudopolynomial Time Algorithms for Subset Sum
• Equal-subset-sum faster than the meet-in-the-middle
• Improving Schroeppel and Shamir’s algorithm for subset sum via orthogonal vectors

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 Q4219034)