Advanced Search
DSpace@MIT

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

Research and Teaching Output of the MIT Community

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

Download
Author: Parekh, Abhay K; Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.
Publisher: Laboratory for Information and Decision Systems, Massachusetts Institute of Technology
Date Issued: 1988
Description:
Bibliography: leaf 9.
URI: http://hdl.handle.net/1721.1/3062
Series/Report no.: LIDS-P ; 1777
Keywords: TK7855.M41 E3845 no.1777

Show full item metadata

Files in this item

Name Size Format Description
P-1777-18693606.pdf 520.4Kb PDF

This item appears in the following Collection(s)

MIT-Mirage