Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/3062
Title: A note on the greedy approximation algorithm for the unweighted set covering problem
Authors: Parekh, Abhay K
Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.
Keywords: TK7855.M41 E3845 no.1777
Issue Date: 5-Jun-2013
Publisher: Laboratory for Information and Decision Systems, Massachusetts Institute of Technology
Description: Abhay K. Parekh.
Bibliography: leaf 9.
URI: http://koha.mediu.edu.my:8181/xmlui/handle/1721
Other Identifiers: http://hdl.handle.net/1721.1/3062
Appears in Collections:MIT Items

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.