Completing a k-1 assignment
Svante Linusson, Johan Waestlund
Abstract
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 give closed formulas for both the Laplace transform of this random variable and for its expected value under the condition that there is a zero-cost k-1-assignment.
Create a lesson
Related papers
Fractional colorings of Kr-free graphs with local demands
Ewan Davies, Abhishek Dhawan, Abhishek Methuku et al.
Short permutation pattern waves: The complete length-five classification
Lihong Qiu, Minglei Mao, Yaping Mao
Automatic partition identities
Laurent Bartholdi
Well-Covered Powers: Cartesian Products and Cayley Graphs
Haobo Ma, Thanh Vu, Wenlin Zhang
Lemmas and Conjectures in Spectral Graph Theory
Tristan Cazenave
On the lower- and upper bounds of three-colored anti-Ramsey numbers
Máté Giesz