Artykuł w czasopiśmie
Brak miniatury
Licencja
ClosedAccessDostęp zamknięty
 

Tight Bounds on Subexponential Time Approximation of Set Cover and Related Problems

Uproszczony widok
dc.affiliationUniwersytet Warszawski
dc.conference.countryWłochy
dc.conference.datefinish2020-09-10
dc.conference.datestart2020-09-09
dc.conference.placePisa
dc.conference.seriesWorkshop on Approximation and Online Algorithms
dc.conference.seriesWorkshop on Approximation and Online Algorithms
dc.conference.seriesshortcutWAOA
dc.conference.shortcutWAOA 2020
dc.conference.weblinkhttp://algo2020.di.unipi.it/WAOA2020/index.html#committees
dc.contributor.authorCygan, Marek
dc.contributor.authorKortsarz, Guy
dc.contributor.authorHalldórsson, Magnús M.
dc.date.accessioned2024-01-26T10:53:14Z
dc.date.available2024-01-26T10:53:14Z
dc.date.issued2021
dc.description.financePublikacja bezkosztowa
dc.identifier.doi10.1007/978-3-030-80879-2_11
dc.identifier.urihttps://repozytorium.uw.edu.pl//handle/item/123408
dc.identifier.weblinkhttps://link.springer.com/chapter/10.1007/978-3-030-80879-2_11
dc.languageeng
dc.pbn.affiliationcomputer and information sciences
dc.relation.pages159–173
dc.rightsClosedAccess
dc.sciencecloudnosend
dc.subject.enSubexponential time algorithms
dc.subject.enLower bounds
dc.subject.enSet cover
dc.titleTight Bounds on Subexponential Time Approximation of Set Cover and Related Problems
dc.typeJournalArticle
dspace.entity.typePublication