We give a (1 - 1/e)-approximation algorithm for the Max-Profit Generalized Assignment Problem (Max-GAP) with fixed profits when the profit (but not necessarily the size) of every ...
The generalized LR parsing algorithm for context-free grammars is extended for the case of Boolean grammars, which are a generalization of the context-free grammars with logical c...
We introduce a gain-scaling technique for the generalized maximum ow problem. Using this technique, we present three simple and intuitive polynomial-time combinatorialalgorithms fo...
The set of all linear recurrence relations satisfied by given sequences of finite length is described by the annihilator ideal of the sequences. The MasseyDing algorithm to compu...
In this paper we propose a novel message-passing algorithm, the so-called Action-GDL, as an extension to the Generalized Distributive Law algorithm (GDL) [1] to efficiently solve...