Submodular function optimisation has emerged as a cornerstone of contemporary algorithm design, offering a powerful framework to address a broad range of combinatorial problems characterised by the ...

We design new approximation algorithms for the problems of optimizing submodular and supermodular functions subject to a single matroid constraint. Specifically, we consider the case in which we wish ...

Complexity of linear programming with the ellipsoid method Separation and optimization Path-following interior point methods, including self-dual methods Column- and row-generation algorithms for ...

Optimization problems are everywhere in engineering: Balancing design tradeoffs is an optimization problem, as are scheduling and logistical planning. The theory -- and sometimes the implementation -- ...