DSpace Repository

A note on the greedy approximation algorithm for the unweighted set covering problem

Show simple item record

dc.contributor Parekh, Abhay K
dc.contributor Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.
dc.date 2003-04-29T15:30:51Z
dc.date 2003-04-29T15:30:51Z
dc.date 1988
dc.date.accessioned 2013-06-04T16:16:00Z
dc.date.available 2013-06-04T16:16:00Z
dc.date.issued 2013-06-05
dc.identifier http://hdl.handle.net/1721.1/3062
dc.identifier.uri http://koha.mediu.edu.my:8181/xmlui/handle/1721
dc.description Abhay K. Parekh.
dc.description Bibliography: leaf 9.
dc.format 9 leaves
dc.format 532963 bytes
dc.format application/pdf
dc.language eng
dc.publisher Laboratory for Information and Decision Systems, Massachusetts Institute of Technology
dc.relation LIDS-P ; 1777
dc.subject TK7855.M41 E3845 no.1777
dc.title A note on the greedy approximation algorithm for the unweighted set covering problem


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account