— We present a review of the various integer linear programming (ILP) formulations that have been proposed for the routing and wavelength assignment problem in WDM optical networ...
This paper presents an algorithm, called PCG, for planning the foothold positions of spider-like robots in planar tunnels bounded by piecewise linear walls. The paper focuses on 3-...
We give the first nontrivial model-independent time-space tradeoffs for satisfiability. Namely, we show that SAT cannot be solved simultaneously in n1+o(1) time and n1space for an...
Given a primal-dual pair of linear programs, it is well known that if their optimal values are viewed as lying on the extended real line, then the duality gap is zero, unless both...
The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...
Simon Goldsmith, Alex Aiken, Daniel Shawcross Wilk...