Back to Results
First PageMeta Content
Mathematics / 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 1
Add to Reading List

Document Date: 2013-11-01 17:11:52

Open Document

File Size: 459,36 KB

Share Result on Facebook
UPDATE