We define an algorithmic paradigm, the stack model, that captures many primal-dual and local-ratio algorithms for approximating covering and packing problems. The stack model is ...
Abstract— We analyze reachability properties and local input/output gains of systems with polynomial vector fields. Upper bounds for the reachable set and nonlinear system gains...
Weehong Tan, Ufuk Topcu, Peter Seiler, Gary J. Bal...
Iterative solvers such as the Jacobi and Gauss-Seidel relaxation methods are important, but time-consuming building blocks of many scientific and engineering applications. The per...
— This paper introduces a hybrid control scheme for steering a non-holonomic agent with limited sensing capabilities and input constraints through a stationary but unknown worksp...
Apollo S. Oikonomopoulos, Savvas G. Loizou, Kostas...
We propose an exact solution method for a routing and capacity installation problem in networks. Given an input graph, the problem is to route traffic from a set of source nodes t...