Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- correctionMay 2020
Correction to: Special Issue on Approximation and Online Algorithms
Theory of Computing Systems (TOCSYS), Volume 64, Issue 4Page 571https://doi.org/10.1007/s00224-020-09972-xThe original version of the article was inadvertently published with misinterpretations on author’s proof corrections on mathematical expressions.
- articleFebruary 2015
Rent or Buy Problems with a Fixed Time Horizon
Theory of Computing Systems (TOCSYS), Volume 56, Issue 2Pages 309–329https://doi.org/10.1007/s00224-014-9552-xWe study several variants of a fixed length ski rental problem and related scheduling problems with rejection. A ski season consists of m days, and an equipment of cost 1 is to be used during these days. The equipment can be bought on any day, in which ...
- articleJanuary 2015
Online Results for Black and White Bin Packing
Theory of Computing Systems (TOCSYS), Volume 56, Issue 1Pages 137–155https://doi.org/10.1007/s00224-014-9538-8In online bin packing problems, items of sizes in [0, 1] are to be partitioned into subsets of total size at most 1, called bins. We introduce a new variant where items are of two types, called black and white, and the item types must alternate in each ...
- articleJanuary 2011
Improved Results for a Memory Allocation Problem
Theory of Computing Systems (TOCSYS), Volume 48, Issue 1Pages 79–92https://doi.org/10.1007/s00224-009-9226-2We consider a memory allocation problem. This problem can be modeled as a version of bin packing where items may be split, but each bin may contain at most two (parts of) items. This problem was recently introduced by Chung et al. (Theory Comput. Syst. ...
- articleFebruary 2010
Class Constrained Bin Covering
Theory of Computing Systems (TOCSYS), Volume 46, Issue 2Pages 246–260https://doi.org/10.1007/s00224-008-9129-7We study the following variant of the bin covering problem. We are given a set of unit sized items, where each item has a color associated with it. We are given an integer parameter k≥1 and an integer bin size B≥k. The goal is to assign the items (or a ...
- articleDecember 2008
Paging with Request Sets
Theory of Computing Systems (TOCSYS), Volume 44, Issue 1Pages 67–81https://doi.org/10.1007/s00224-007-9029-2A generalized paging problem is considered. Each request is expressed as a set of u pages. In order to satisfy the request, at least one of these pages must be in the cache. Therefore, on a page fault, the algorithm must load into the cache at least one ...
- articleMarch 2008
Optimal On-Line Algorithms to Minimize Makespan on Two Machines with Resource Augmentation
Theory of Computing Systems (TOCSYS), Volume 42, Issue 4Pages 431–449https://doi.org/10.1007/s00224-007-9007-8We study the problem of on-line scheduling on two uniformly related machines where the on-line algorithm has resources different from those of the off-line algorithm. We consider three versions of this problem, preemptive semi-online, non-preemptive on-...