The submodular function minimization problem (SFM) is a fundamental problem in
combinatorial optimization and several fully combinatorial polynomial-time algorithms have …

Classical constraint satisfaction is concerned with the feasibility of satisfying a collection of
constraints. The extension of this framework to include optimisation is now also being …

The complexity of any optimisation problem depends critically on the form of the objective
function. Valued constraint satisfaction problems are discrete optimisation problems where …

We present an efficient algorithm to find nonempty minimizers of a symmetric submodular
function f over any family of sets \calI closed under inclusion. Our algorithm makes O(n^3) …

We present a formulation of the source separation problem as the minimization of a
symmetric function defined on fragments of the observed signal. We prove the function to be …

We study three problems arising from different areas of combinatorial optimization. We first
study the matroid secretary problem, which is a generalization proposed by Babaioff …

We generalize source location problems with edge-connectivity requirements on undirected
and directed graphs to similar problems on hypergraphs. In the undirected case we consider …

We formulate the cocktail party problem as the minimization of a symmetric posimodular
function defined on fragments of the signal captured by a single microphone. This …

Abstract The Valued Constraint Satisfaction Problem (VCSP) is a general framework
encompassing many optimisation problems. We discuss precisely what it means for a …

We present an efficient algorithm to find nonempty minimizers of a symmetric submodular
function f over any family of sets I closed under inclusion. Our algorithm makes O (n (3)) …