RSA
2000
13 years 11 months ago
2000
The creation and growth of components of a given complexity in a random graph process are studied. In particular, the expected number and total size of all such components is found...
IPL
2008
13 years 11 months ago
2008
We consider three variants of the open-end bin packing problem. Such variants of bin packing allow the total size of items packed into a bin to exceed the capacity of a bin, provi...
CORR
2008
Springer
13 years 11 months ago
2008
Springer
Two players want to eat a sliced pizza by alternately picking its pieces. The pieces may be of various sizes. After the first piece is eaten every subsequently picked piece must be...
DAM
2010
13 years 11 months ago
2010
Given a set of m identical bins of size 1, the online input consists of a (potentially, infinite) stream of items in (0, 1]. Each item is to be assigned to a bin upon arrival. The ...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
We show that the Parikh image of the language of an NFA with n states over an alphabet of size k can be described as a finite union of linear sets with at most k generators and to...
SODA
1998
ACM
14 years 24 days ago
1998
ACM
Consider the following file caching problem: in response to a sequence of requests for files, where each file has a specified size and retrieval cost, maintain a cache of files of ...
CCCG
2010
14 years 27 days ago
2010
Given a set R of red points and a set B of blue points in the plane of total size n, we study the problem of determining all angles for which there exists an L-shape containing al...