Path: utzoo!utgpu!news-server.csri.toronto.edu!mailrus!cs.utexas.edu!usc!zaphod.mps.ohio-state.edu!sdd.hp.com!elroy.jpl.nasa.gov!ames!dftsrv!mimsy!tove.cs.umd.edu!rng
From: rng@tove.cs.umd.edu (raymond ng )
Newsgroups: comp.theory
Subject: Approximation to Knapsack
Message-ID: <24799@mimsy.umd.edu>
Date: 7 Jun 90 20:49:28 GMT
Sender: news@mimsy.umd.edu
Reply-To: rng@tove.cs.umd.edu (raymond ng )
Distribution: na
Organization: U of Maryland, Dept. of Computer Science, Coll. Pk., MD 20742
Lines: 5

Are there "good" approximations to the Knapsack problem? If so, I
would like to know the references. Please respond directly to 
rng@cs.umd.edu. Thanks. 

Raymond Ng