We present a (2 3 − o(1))-approximation algorithm for the partial latin square extension (PLSE) problem. This improves the current best bound of 1 − 1 e due to Gomes, Regis, an...
Iman Hajirasouliha, Hossein Jowhari, Ravi Kumar, R...
An instance of the classical Stable Roommates problem (sr) need not admit a stable matching. This motivates the problem of finding a matching that is “as stable as possible”, ...
Professional sports leagues are a major economic activity around the world. Teams and leagues do not want to waste their investments in players and structure in consequence of poo...
The problem of computing low rank approximations of matrices is considered. The novel aspect of our approach is that the low rank approximations are on a collection of matrices. W...
— Cellular simultaneous recurrent neural network has been suggested to be a function approximator more powerful than the MLP’s, in particular for solving approximate dynamic pr...