TCS
2010
13 years 10 months ago
2010
TCS
2010
13 years 10 months ago
2010
We study the following variant of the bin packing problem. We are given a set of items, where each item has a (non-negative) size and a color. We are also given an integer paramet...
TCS
2010
13 years 10 months ago
2010
We study non-uniform constraint satisfaction problems definable in monadic Datalog stratified by the use of non-linearity. We show how such problems can be described in terms of...
TCS
2010
13 years 10 months ago
2010
TCS
2010
13 years 10 months ago
2010
TCS
2010
13 years 10 months ago
2010
In a left-forbidding grammar, a set of nonterminals is attached to every context-free production, and such a production can rewrite a nonterminal if no symbol from the attached se...
TCS
2010
13 years 10 months ago
2010
TCS
2010
13 years 10 months ago
2010
TCS
2010
13 years 10 months ago
2010
It is well known that the two simple algorithms for the classic bin packing problem, NF and WF both have an approximation ratio of 2. However, WF seems to be a more reasonable alg...
TCS
2010
13 years 10 months ago
2010
Borodin, Nielsen and Rackoff [13] introduced the class of priority algorithms as a framework for modeling deterministic greedy-like algorithms. In this paper we address the effe...