We build on the classical greedy sequential set cover algorithm, in the spirit of the primal-dual schema, to obtain simple parallel approximation algorithms for the set cover probl...
We present a simple family of algorithms for solving the Generalized Assignment Problem (GAP). Our technique is based on a novel combinatorial translation of any algorithm for the...
We consider generalized discrete timed automata with general linear relations over clocks and parameterized constants as clock constraints and with parameterized durations. We look...
We consider finite element operators defined on "rough" functions in a bounded polyhedron in RN . Insisting on preserving positivity in the approximations, we discover a...
This paper is concerned with the stability of rational one-step approximations of C0 semigroups. Particular emphasis is laid on long-term stability bounds. The analysis is based on...