This paper addresses the state estimation problem of nonlinear systems. We formulate the problem using a minimum energy estimator (MEE) approach and propose an entropy penalized sc...
Sergio Daniel Pequito, A. Pedro Aguiar, Diogo A. G...
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
We consider labeled Traveling Salesman Problems, defined upon a complete graph of n vertices with colored edges. The objective is to find a tour of maximum or minimum number of co...
This paper investigates, for the first time in the literature, the approximation of minmax (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...
Abstract. The input of the Edge Multicut problem consists of an undirected graph G and pairs of terminals {s1, t1}, . . . , {sm, tm}; the task is to remove a minimum set of edges s...