Subset sum problem

I have a variation of the subset sum problem I want to solve:

Given a finite set W of real numbers, of cardinality n,
real number s, and integer k <= n, find a subset of W
of cardinality k whose sum is as close as possible to s.

This problem is I'm sure NP-complete, I'd like to know what
approximation algorithms are available.



.

Relevant Pages

  • Re: fastest way to print a lot of pdf files?
    ... >> within a classic system of mathematics like the one you have in mind, ... > indicates you don't know what cardinality means, ... > array of a finite set of symbols and the integers. ... Now tell me how they create that bijection of yours- indeed, ...
    (comp.os.linux.misc)
  • Re: Godel proved maths inconsistent not incompleteness theorem
    ... all finite sets have the same cardinality, ... Every finite set has the same cardinality. ... it may serve as a definition of aleph-0. ... -- New York Times movie reviewer A. O. Scott ...
    (sci.logic)
  • countability of reals
    ... A one-to-one correspondence can be set up between the set IQ ... X_n is a finite set. ... transfinite induction is not required. ... The cardinality of IX is not larger than ...
    (sci.math)
  • Re: Extrapolating linear ratios
    ... Every FINITE set, dumbass. ... Obviously infinite sets of naturals do not contain ANY numbers larger ... than the cardinality of the set, since the cardinality of the set is ...
    (sci.logic)
  • Re: abundance of irrationals!)
    ... > Franziska Neugebauer wrote: ... >>> does not state anything about the cardinality of the set. ... >>> for any finite set, because we dobt the existence of infinite sets. ... >> of red apples. ...
    (sci.math)