ITEM VIEW

Two new combinatorial problems involving dominating sets for lottery schemes

dc.contributor.advisorVan Vuuren, J. H.
dc.contributor.advisorBurger, A. P.
dc.contributor.authorGrundlingh, Werner R.en_ZA
dc.contributor.otherUniversity of Stellenbosch. Faculty of Science. Dept. of Mathematical Sciences. Applied Mathematics.
dc.date.accessioned2006-11-17T09:33:22Zen_ZA
dc.date.accessioned2010-06-01T08:20:26Z
dc.date.available2006-11-17T09:33:22Zen_ZA
dc.date.available2010-06-01T08:20:26Z
dc.date.issued2004-12
dc.identifier.urihttp://hdl.handle.net/10019.1/1388
dc.descriptionThesis (PhD (Mathematical Sciences. Applied Mathematics))--University of Stellenbosch, 2004.
dc.description.abstractSuppose a lottery scheme consists of randomly selecting an unordered winning n-subset from a universal set of m numbers, while a player participates in the scheme by purchasing a playing set of any number of unordered n-subsets from the same universal set prior to a winning draw, and is awarded a prize if ...en_ZA
dc.format.extent2600216 bytesen_ZA
dc.format.mimetypeapplication/pdfen_ZA
dc.language.isoen
dc.publisherStellenbosch : University of Stellenbosch
dc.subjectCombinatorial optimization
dc.subjectGames of chance (Mathematics)
dc.subjectLotteries -- Mathematics
dc.subjectDomination (Graph theory)
dc.subjectDissertations -- Applied mathematics
dc.subjectTheses -- Applied mathematics
dc.titleTwo new combinatorial problems involving dominating sets for lottery schemesen_ZA
dc.typeThesisen_ZA
dc.rights.holderUniversity of Stellenbosch


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

ITEM VIEW