# 2 Search Results for "Böckenhauer, Hans-Joachim"

Document
##### Online Simple Knapsack with Reservation Costs

Authors: Hans-Joachim Böckenhauer, Elisabet Burjons, Juraj Hromkovič, Henri Lotze, and Peter Rossmanith

Published in: LIPIcs, Volume 187, 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)

##### Abstract
In the Online Simple Knapsack Problem we are given a knapsack of unit size 1. Items of size smaller or equal to 1 are presented in an iterative fashion and an algorithm has to decide whether to permanently reject or include each item into the knapsack without any knowledge about the rest of the instance. The goal is then to pack the knapsack as full as possible. In this work, we introduce a third option additional to those of packing and rejecting an item, namely that of reserving an item for the cost of a fixed fraction α of its size. An algorithm may pay this fraction in order to postpone its decision on whether to include or reject the item until after the last item of the instance was presented. While the classical Online Simple Knapsack Problem does not admit any constantly bounded competitive ratio in the deterministic setting, we find that adding the possibility of reservation makes the problem constantly competitive, with varying competitive ratios depending on the value of α. We give upper and lower bounds for the whole range of reservation costs, with tight bounds for costs up to 1/6 - an area that is strictly 2-competitive - , for costs between √2-1 and 1 - an area that is strictly (2+α)-competitive up to ϕ -1, and strictly 1/(1-α)-competitive above ϕ-1, where ϕ is the golden ratio. With our analysis, we find a counterintuitive characteristic of the problem: Intuitively, one would expect that the possibility of rejecting items becomes more and more helpful for an online algorithm with growing reservation costs. However, for higher reservation costs above √2-1, an algorithm that is unable to reject any items tightly matches the lower bound and is thus the best possible. On the other hand, for any positive reservation cost smaller than 1/6, any algorithm that is unable to reject any items performs considerably worse than one that is able to reject.

##### Cite as

Hans-Joachim Böckenhauer, Elisabet Burjons, Juraj Hromkovič, Henri Lotze, and Peter Rossmanith. Online Simple Knapsack with Reservation Costs. In 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 187, pp. 16:1-16:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)

```@InProceedings{bockenhauer_et_al:LIPIcs.STACS.2021.16,
author =	{B\"{o}ckenhauer, Hans-Joachim and Burjons, Elisabet and Hromkovi\v{c}, Juraj and Lotze, Henri and Rossmanith, Peter},
title =	{{Online Simple Knapsack with Reservation Costs}},
booktitle =	{38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)},
pages =	{16:1--16:18},
series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN =	{978-3-95977-180-1},
ISSN =	{1868-8969},
year =	{2021},
volume =	{187},
editor =	{Bl\"{a}ser, Markus and Monmege, Benjamin},
publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.16},
URN =		{urn:nbn:de:0030-drops-136613},
doi =		{10.4230/LIPIcs.STACS.2021.16},
annote =	{Keywords: Online problem, Simple knapsack, Reservation costs}
}```
Document
##### Finding Optimal Solutions With Neighborly Help

Authors: Elisabet Burjons, Fabian Frei, Edith Hemaspaandra, Dennis Komm, and David Wehner

Published in: LIPIcs, Volume 138, 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)

##### Abstract
Can we efficiently compute optimal solutions to instances of a hard problem from optimal solutions to neighboring (i.e., locally modified) instances? For example, can we efficiently compute an optimal coloring for a graph from optimal colorings for all one-edge-deleted subgraphs? Studying such questions not only gives detailed insight into the structure of the problem itself, but also into the complexity of related problems; most notably graph theory’s core notion of critical graphs (e.g., graphs whose chromatic number decreases under deletion of an arbitrary edge) and the complexity-theoretic notion of minimality problems (also called criticality problems, e.g., recognizing graphs that become 3-colorable when an arbitrary edge is deleted). We focus on two prototypical graph problems, Colorability and Vertex Cover. For example, we show that it is NP-hard to compute an optimal coloring for a graph from optimal colorings for all its one-vertex-deleted subgraphs, and that this remains true even when optimal solutions for all one-edge-deleted subgraphs are given. In contrast, computing an optimal coloring from all (or even just two) one-edge-added supergraphs is in P. We observe that Vertex Cover exhibits a remarkably different behavior, demonstrating the power of our model to delineate problems from each other more precisely on a structural level. Moreover, we provide a number of new complexity results for minimality and criticality problems. For example, we prove that Minimal-3-UnColorability is complete for DP (differences of NP sets), which was previously known only for the more amenable case of deleting vertices rather than edges. For Vertex Cover, we show that recognizing beta-vertex-critical graphs is complete for Theta_2^p (parallel access to NP), obtaining the first completeness result for a criticality problem for this class.

##### Cite as

Elisabet Burjons, Fabian Frei, Edith Hemaspaandra, Dennis Komm, and David Wehner. Finding Optimal Solutions With Neighborly Help. In 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 138, pp. 78:1-78:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)

```@InProceedings{burjons_et_al:LIPIcs.MFCS.2019.78,
author =	{Burjons, Elisabet and Frei, Fabian and Hemaspaandra, Edith and Komm, Dennis and Wehner, David},
title =	{{Finding Optimal Solutions With Neighborly Help}},
booktitle =	{44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)},
pages =	{78:1--78:14},
series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN =	{978-3-95977-117-7},
ISSN =	{1868-8969},
year =	{2019},
volume =	{138},
editor =	{Rossmanith, Peter and Heggernes, Pinar and Katoen, Joost-Pieter},
publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2019.78},
URN =		{urn:nbn:de:0030-drops-110221},
doi =		{10.4230/LIPIcs.MFCS.2019.78},
annote =	{Keywords: Critical Graphs, Computational Complexity, Structural Self-Reducibility, Minimality Problems, Colorability, Vertex Cover, Satisfiability, Reoptimization, Advice}
}```
• Refine by Author
• 2 Burjons, Elisabet
• 1 Böckenhauer, Hans-Joachim
• 1 Frei, Fabian
• 1 Hemaspaandra, Edith
• 1 Hromkovič, Juraj

• Refine by Classification
• 1 Theory of computation → Complexity classes
• 1 Theory of computation → Online algorithms
• 1 Theory of computation → Problems, reductions and completeness

• Refine by Keyword
• 1 Colorability
• 1 Computational Complexity
• 1 Critical Graphs
• 1 Minimality Problems

• Refine by Type
• 2 document

• Refine by Publication Year
• 1 2019
• 1 2021

X

Feedback for Dagstuhl Publishing

Feedback submitted

### Could not send message

Please try again later or send an E-mail