Weighted Online Problems with Advice

Joan Boyar, Lene Monrad Favrholdt, Christian Kudahl, Jesper With Mikkelsen

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review


Recently, the first online complexity class, AOC , was introduced. The class consists of many online problems where each request must be either accepted or rejected, and the aim is to either minimize or maximize the number of accepted requests, while maintaining a feasible solution. All AOC -complete problems (including Independent Set, Vertex Cover, Dominating Set, and Set Cover) have essentially the same advice complexity. In this paper, we study weighted versions of problems in AOC , i.e., each request comes with a weight and the aim is to either minimize or maximize the total weight of the accepted requests. In contrast to the unweighted versions, we show that there is a significant difference in the advice complexity of complete minimization and maximization problems. We also show that our algorithmic techniques for dealing with weighted requests can be extended to work for non-complete AOC problems such as Matching (giving better results than what follow from the general AOC results) and even non- AOC problems such as scheduling.
Original languageEnglish
Title of host publicationCombinatorial Algorithms : 27th International Workshop, IWOCA 2016
EditorsVeli Mäkinen, Simon J. Puglisi, Leena Salmela
Publication date2016
ISBN (Print)978-3-319-44542-7
ISBN (Electronic)978-3-319-44543-4
Publication statusPublished - 2016
Event27th International Workshop on Combinatorial Algorithms - Helsinki, Finland
Duration: 17. Aug 201619. Aug 2016


Conference27th International Workshop on Combinatorial Algorithms
SeriesLecture Notes in Computer Science


Dive into the research topics of 'Weighted Online Problems with Advice'. Together they form a unique fingerprint.

Cite this