6 citations · 10 across the 4 of their papers we have counts for
5 papers · 1 filter
Completing a k-1 assignment
Svante Linusson, Johan Waestlund
We consider the distribution of the value of the optimal k-assignment in an m x n-matrix, where the entries are independent exponential random variables with arbitrary rates. We gi…
Complexes of graphs with bounded matching size
Svante Linusson, John Shareshian, Volkmar Welker
For positive integers k,n, we investigate the simplicial complex NM_k(n) of all graphs G on vertex set [n] such that every matching in G has size less than k. This complex (along w…
A proof of a conjecture of Buck, Chan and Robbins on the random assignment problem
Svante Linusson, Johan W"astlund
We prove the main conjecture of the paper ``On the expected value of the minimum assignment'' by Marshall W. Buck, Clara S. Chan, and David P. Robbins (Random Structures & Algorith…
A Proof of Parisi's Conjecture on the Random Assignment Problem
Svante Linusson, Johan Waestlund
An assignment problem is the optimization problem of finding, in an m by n matrix of nonnegative real numbers, k entries, no two in the same row or column, such that their sum is m…
A Generalization of the Random Assignment Problem
Svante Linusson, Johan Waestlund
We give a conjecture for the expected value of the optimal k-assignment in an m x n-matrix, where the entries are all exp(1)-distributed random variables or zeros. We prove this co…