Combinatorial optimisation is a fundamental field in applied mathematics and computer science that focuses on finding an optimal object from a finite set of objects. In this context, problems are ...

We present a new optimization-based method for aggregating preferences in settings in which each voter expresses preferences over pairs of alternatives. Our approach to identifying a consensus partial ...

Part of the DynGraphLab — Dynamic Graph Algorithms open source framework. Developed at the Algorithm Engineering Group, Heidelberg University. Python Interface: An easy-to-use Python interface for ...

Abstract: This paper presents a parallel algorithm for the maximum sub array problem implemented on a machine with GPUs. Given a sequence of numbers, the maximum subsequence is a contiguous ...

> A subarray `A[i], A[i+1], ..., A[j]` of `A` is said to be _turbulent_ if and only if: > * For `i <= k < j`, `A[k] > A[k+1]` when `k` is odd, and `A[k] < A[k+1 ...