The online knapsack problem: Advice and randomization
نویسندگان
چکیده
منابع مشابه
The online knapsack problem: Advice and randomization
We study the advice complexity and the random bit complexity of the online knapsack problem. Given a knapsack of unit capacity, and n items that arrive in successive time steps, an online algorithm has to decide for every item whether it gets packed into the knapsack or not. The goal is to maximize the value of the items in the knapsack without exceeding its capacity. In the model of advice com...
متن کاملAdvice and Randomization in Online Computation
Online computation is both of theoretical interest and practical relevance as numerous computational problems require a model in which algorithms do not know the whole input at every time step during runtime. The established measurement for the output quality of these online algorithms is the so-called competitive analysis, introduced by Sleator and Tarjan in 1985. Similar to the decrease in ac...
متن کاملOnline Minimization Knapsack Problem
In this paper, we address the online minimization knapsack problem, i. e., the items are given one by one over time and the goal is to minimize the total cost of items that covers a knapsack. We study the removable model, where it is allowed to remove old items from the knapsack in order to accept a new item. We obtain the following results. (i) We propose an 8-competitive deterministic algorit...
متن کاملOn the Advice Complexity of the Knapsack Problem
We study the advice complexity and the random bit complexity of the online knapsack problem: Given a knapsack of unit capacity, and n items that arrive in successive time steps, an online algorithm has to decide for every item whether it gets packed into the knapsack or not. The goal is to maximize the value of the items in the knapsack without exceeding its capacity. In the model of advice com...
متن کاملInformation content of online problems: advice versus determinism and randomization
In online computation, an algorithm has to solve some optimization problem while receiving the input instance gradually, without any knowledge about the future input. Such an online algorithm has to compute parts of the output for parts of the input, based on what it knows about the input so far and without being able to revoke its decisions later. Almost inevitably, the algorithm makes a bad c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2014
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2014.01.027