Please use this identifier to cite or link to this item:
http://hdl.handle.net/10263/1179Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Ramamurthy, K G | - |
| dc.contributor.author | Parthasarathy, T | - |
| dc.date.accessioned | 2011-02-09T06:19:38Z | - |
| dc.date.available | 2011-02-09T06:19:38Z | - |
| dc.date.issued | 1986 | - |
| dc.identifier.citation | OPSEARCHV23(1)P1-6 | en_US |
| dc.identifier.uri | http://hdl.handle.net/10263/1179 | - |
| dc.language.iso | en | en_US |
| dc.subject | Set | en_US |
| dc.subject | Algorithm | en_US |
| dc.title | An algorithm to find the smallest committee containing a given set | en_US |
| dc.type | Article | en_US |
| Appears in Collections: | Economics | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| O-23-1-1986-P1-6.pdf | 175.51 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.