By Topic

An online partially fractional knapsack problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Noga, J. ; Dept. of Comput. Sci., California State Univ., Northridge, CA, USA ; Sarbua, V.

The knapsack problem can and has been used to model many resource sharing problems. The allocation of a portion of a resource to a particular agent provides a benefit to the system, but also blocks other agents from utilizing that portion of the resource. For a problem where the number of agents as well as each agent's demand and potential benefit are known prior to any decision being made, the optimal allocation and its value can be calculated. In many situations these values are not known initially, but only learned over time. Online algorithms and competitive analysis are often employed when a problem requires decisions to be made prior to having all information available. In this paper we suggest an online version of the knapsack problem, provide some justification for the model, give the exact competitive ratio for the problem in the deterministic case, and provide bounds on the competitive ratio in the randomized case.

Published in:

Parallel Architectures,Algorithms and Networks, 2005. ISPAN 2005. Proceedings. 8th International Symposium on

Date of Conference:

7-9 Dec. 2005