Efficient approximation algorithms for the subset-sums equality problem.
type: Item
instance of: scholarly article
title: Efficient approximation algorithms for the subset-sums equality problem.
zbMATH Open document ID: 1078.90037
author: Cristina Bazgan
author: Miklos Santha
author: Zsolt Tuza
published in: Journal of Computer and System Sciences
publication date: 2002-08-04T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 68W40
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 1775693
MaRDI profile type: Publication
full work available at URL: jcss.2001.1784
OpenAlex ID: W2053876898
cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
cites work: Q4142699
cites work: On total functions, existence theorems and computational complexity
cites work: On the complexity of the parity argument and other inefficient proofs of existence
cites work: On the equal-subset-sum problem
DOI: 10.1006/JCSS.2001.1784
description: scientific article; zbMATH DE number 1775693