We design a faster algorithm for the k-maximum sub-array problem under the conventional RAM model, based on distance matrix multiplication (DMM). Specifically we achieve O(n3 log ...
We are given a directed network G = (V, A, u) with vertex set V , arc set A, a source vertex s V , a destination vertex t V , a finite capacity vector u = {uij}ijA, and a positi...
— We give an optimal solution to the Maximum All Request Path Grooming (MARPG) problem motivated by a traffic grooming application. The MARPG problem consists in finding the ma...
Jean-Claude Bermond, Michel Cosnard, David Coudert...
Abstract Abstract. In this paper we improve the analysis of approximation algorithms based on semidefinite programming for the maximum graph partitioning problems MAX-k-CUT, MAX-k...
We discuss and analyze the problem of finding a distribution that minimizes the relative entropy to a prior distribution while satisfying max-norm constraints with respect to an ...