An algorithm to find the smallest committee containing a given set

Simple item page
dc.contributor.authorRamamurthy, K G
dc.contributor.authorParthasarathy, T
dc.date.accessioned2011-02-09T06:19:38Z
dc.date.available2011-02-09T06:19:38Z
dc.date.issued1986
dc.identifier.citationOPSEARCHV23(1)P1-6en_US
dc.identifier.urihttp://hdl.handle.net/10263/1179
dc.language.isoenen_US
dc.subjectSeten_US
dc.subjectAlgorithmen_US
dc.titleAn algorithm to find the smallest committee containing a given seten_US
dc.typeArticleen_US

Files

Original bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
O-23-1-1986-P1-6.pdf
Size:
175.51 KB
Format:
Adobe Portable Document Format
Download

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Economics