Date: 2013-11-01 17:11:52Mathematics Computational complexity theory Algebra NP-complete problems Analysis of algorithms Set cover problem Bin packing problem Linear programming relaxation Vertex cover Ring Exponentiation Big O notation | | Set Covering with Ordered Replacement: Additive and Multiplicative Gaps Friedrich Eisenbrand1 , Naonori Kakimura?2 , Thomas Rothvoß??1 , and Laura Sanità? ? ?1 1Add to Reading ListSource URL: www.math.washington.eduDownload Document from Source Website File Size: 459,36 KBShare Document on Facebook
|