Weighted Online Problems with Advice

  • Joan Boyar
  • Lene M. Favrholdt
  • Christian Kudahl
  • Jesper W. Mikkelsen
Conference paper

DOI: 10.1007/978-3-319-44543-4_14

Part of the Lecture Notes in Computer Science book series (LNCS, volume 9843)
Cite this paper as:
Boyar J., Favrholdt L.M., Kudahl C., Mikkelsen J.W. (2016) Weighted Online Problems with Advice. In: Mäkinen V., Puglisi S., Salmela L. (eds) Combinatorial Algorithms. IWOCA 2016. Lecture Notes in Computer Science, vol 9843. Springer, Cham

Abstract

Recently, the first online complexity class, \(\mathsf {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 \(\mathsf {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 \(\mathsf {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 \(\mathsf {AOC}\) problems such as Matching (giving better results than what follow from the general \(\mathsf {AOC}\) results) and even non-\(\mathsf {AOC}\) problems such as scheduling.

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  • Joan Boyar
    • 1
  • Lene M. Favrholdt
    • 1
  • Christian Kudahl
    • 1
  • Jesper W. Mikkelsen
    • 1
  1. 1.Department of Mathematics and Computer ScienceUniversity of Southern DenmarkOdenseDenmark

Personalised recommendations