An Almost Linear-Time Algorithm for the Dense Subset-Sum Problem

This paper describes a new approach for solving the subset-sum problem. It is useful for solving other NP-hard problems. The limits and potential of this approach are discussed. The approach yields an algorithm for solving the dense version of the subset-sum problem. It runs in time $O(\ell \log \el...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:SIAM journal on computing Ročník 20; číslo 6; s. 1157 - 1189
Hlavní autoři: Galil, Zvi, Margalit, Oded
Médium: Journal Article
Jazyk:angličtina
Vydáno: Philadelphia, PA Society for Industrial and Applied Mathematics 01.12.1991
Témata:
Algorithms
Approximation
Classical combinatorial problems
Combinatorics
Combinatorics. Ordered structures
Computer science
Dynamic programming
Exact sciences and technology
Integer programming
Mathematics
Sciences and techniques of general use
Integer
Integer programming
Partition
Algorithm complexity
NP hard problem
Combinatory problem
Progression arithmétique
ISSN:0097-5397, 1095-7111
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:This paper describes a new approach for solving the subset-sum problem. It is useful for solving other NP-hard problems. The limits and potential of this approach are discussed. The approach yields an algorithm for solving the dense version of the subset-sum problem. It runs in time $O(\ell \log \ell )$, where $\ell $ is the bound on the size of the elements. But for dense enough inputs and target numbers near the middle sum, it runs in time $O(m)$, where $m$ is the number of elements. Consequently, it improves the previously best algorithms by at least one order of magnitude and sometimes by two. The algorithm yields a characterization of the set of subset sums as a collection of arithmetic progressions with the same difference. This characterization is derived by elementary number-theoretic and algorithmic techniques. Such a characterization was first obtained by using analytic number theory and yielded inferior algorithms.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 14
ISSN:0097-5397
1095-7111
DOI:10.1137/0220072