Authors
Citation
Mn. Kolountzakis, SELECTION OF A LARGE SUM-FREE SUBSET IN POLYNOMIAL-TIME, Information processing letters, 49(5), 1994, pp. 255-256
Citations number
4
Categorie Soggetti
Information Science & Library Science","Computer Science Information Systems
Journal title
ISSN journal
00200190
Volume
49
Issue
5
Year of publication
1994
Pages
255 - 256
Database
ISI
SICI code
0020-0190(1994)49:5<255:SOALSS>2.0.ZU;2-N
Abstract
A set of E of integers is called sum-free if x + y not-equal z for all
x,y,z is-an-element-of E. Given a set A = {n1,...,n(N)} of integers w
e show how to extract a sum-free subset E of A with \E\ > N/3. The alg
orithm requires polynomial time in the size of the input.