A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
On the Advice Complexity of the Set Cover Problem
[chapter]
2012
Lecture Notes in Computer Science
Recently, a new approach to get a deeper understanding of online computation has been introduced: the study of the advice complexity of online problems. The idea is to measure the information that online algorithms need to be supplied with to compute high-quality solutions and to overcome the drawback of not knowing future input requests. In this paper, we study the advice complexity of an online version of the well-known set cover problem introduced by Alon et al.: for a ground set of size n
doi:10.1007/978-3-642-30642-6_23
fatcat:qluinziykvbmfinqboqp3k5xpi