Efficient approximation algorithms for the SUBSET-SUMS EQUALITY problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1443 LNCS, Issue , 1998, Pages 387-396

  Bazgan, Cristina ^a   Santha, Miklos ^b   Tuza, Zsolt ^c  

^a UNIVERSITÉ PARIS SACLAY   (France)

^b CNRS   (France)

^c INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; POLYNOMIAL APPROXIMATION; SET THEORY;

DISJOINT SUBSETS; EFFICIENT APPROXIMATION ALGORITHMS; FULLY POLYNOMIAL TIME APPROXIMATION SCHEMES; PARTIAL SUMS; POLYNOMIAL-TIME; POLYNOMIAL-TIME ALGORITHMS; POSITIVE INTEGERS; SUBSET SUM;

APPROXIMATION ALGORITHMS;

EID: 22044441120     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0055069     Document Type: Conference Paper

References (7)

1. C. Bazgan, M. Santha and Zs. Tuza, On the approximation of finding a(nother) Hamiltonian cycle in cubic Hamiltonian graphs, 15th Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, Vol. 1373 (1998), 276-286.
2. O. H. Ibarra and C. E. Kim, Fast approximation algorithms for the Knapsack and Sum of Subset problems, J. ACM, 22:4 (1975), 463-468.
3. R. M. Karp, Reducibility among combinatorial problems, in: Complexity of Computer Computations (R. E. Miller and J. W. Thatcher, eds.) (1972), 85-103.
4. H. Kellerer, R. Mansini, U. Pferschy and M. G. Speranza, An efficient fully polynomial approximation scheme for the Subset-Sum problem, manuscript, 1997.
5. N. Megiddo and C. Papadimitriou, On total functions, existence theorems and computational complexity, Theoretical Computer Science, 81 (1991), 317-324.
6. C. Papadimitriou, On the complexity of the parity argument and other inefficient proofs of existence, Journal of Computer and System Sciences 48 (1994), 498-532.
7. G. J. Woeginger and Z. Yu, On the equal-subset-sum problem, Information Processing Letters 42 (1992), 299-302.