Title:
New and Improved Bounds for the Minimum Set Cover Problem

dc.contributor.author Sviridenko, Maxim
dc.date.accessioned 2012-04-23T15:22:08Z
dc.date.available 2012-04-23T15:22:08Z
dc.date.issued 2012-04-23
dc.description.sponsorship IMA, Google Corp., Microsoft Corp., Yandex Corp. en_US
dc.identifier.uri http://hdl.handle.net/1853/43311
dc.subject submodularity en_US
dc.title New and Improved Bounds for the Minimum Set Cover Problem en_US
dc.type Text
dc.type.genre Presentation
dspace.entity.type Publication
local.contributor.corporatename Algorithms and Randomness Center
local.contributor.corporatename College of Computing
local.relation.ispartofseries Modern Aspects of Submodularity
relation.isOrgUnitOfPublication b53238c2-abff-4a83-89ff-3e7b4e7cba3d
relation.isOrgUnitOfPublication c8892b3c-8db6-4b7b-a33a-1b67f7db2021
relation.isSeriesOfPublication b6799d88-f0fe-4101-9772-8f281d4bb42e
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Sviridenko.pdf
Size:
218.88 KB
Format:
Adobe Portable Document Format
Description:
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.76 KB
Format:
Item-specific license agreed upon to submission
Description:
Collections