2 citations · 2 across the 5 of their papers we have counts for
5 papers
Online Unbounded Knapsack
Hans-Joachim Böckenhauer, Matthias Gehnen, Juraj Hromkovič +6
We analyze the competitive ratio and the advice complexity of the online unbounded knapsack problem. An instance is given as a sequence of n items with a size and a value each, and…
Online Simple Knapsack with Reservation Costs
Hans-Joachim Boeckenhauer, Elisabet Burjons, Fabian Frei +3
In the online simple knapsack problem items are presented in an iterative fashion and an algorithm has to decide for each item whether to reject or permanently include it into the…
Advice Complexity of the Online Search Problem
Jhoirene Clemente, Juraj Hromkovic, Dennis Komm +1
The online search problem is a fundamental problem in finance. The numerous direct applications include searching for optimal prices for commodity trading and trading foreign curre…
On the Approximability and Hardness of Minimum Topic Connected Overlay and Its Special Instances
Jun Hosoda, Juraj Hromkovic, Taisuke Izumi +3
In the context of designing a scalable overlay network to support decentralized topic-based pub/sub communication, the Minimum Topic-Connected Overlay problem (Min-TCO in short) ha…
Ambiguity and Communication
Juraj Hromkovic, Georg Schnitger
The ambiguity of a nondeterministic finite automaton (NFA) N for input size n is the maximal number of accepting computations of N for an input of size n. For all k, r 2 N we const…