We study the admission control problem in general networks. Communication requests arrive over time, and the online algorithm accepts or rejects each request while maintaining the...
We consider the following generalization of bin packing. Each item is associated with a size bounded by 1, as well as a rejection cost, that an algorithm must pay if it chooses not...
The standard dynamic programming solution to finding k-medians on a line with n nodes requires O(kn2 ) time. Dynamic programming speedup techniques, e.g., use of the quadrangle i...
Abstract. We consider the offline and online versions of a bin packing problem called bin packing with conflicts. Given a set of items V = {1, 2, . . . , n} with sizes s1, s2 . . ....
Abstract. A classical problem in query optimization is to find the optimal ordering of a set of possibly correlated selections. We provide an ion of this problem as a generalizati...