139
click to vote
APPROX
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. In this paper, we consider two new online optimization problems (each with several variants), present similar online algorithms for both, and show that one reduces to the...
148
click to vote
CASSIS
2004
Springer
15 years 7 months ago
2004
Springer
The JAVA CARD transaction mechanism can ensure that a sequence of statements either is executed to completion or is not executed at all. Transactions make verification of JAVA CARD...
128
click to vote
APPROX
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. We introduce and study the following model for routing uncertain demands through a network. We are given a capacitated multicommodity flow network with a single source an...
132
click to vote
APPROX
2006
Springer
15 years 7 months ago
2006
Springer
In the minimum entropy set cover problem, one is given a collection of k sets which collectively cover an n-element ground set. A feasible solution of the problem is a partition o...