Completing a k-1 assignment
Combinatorics
2007-05-23 v1 Probability
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.
Cite
@article{arxiv.math/0410347,
title = {Completing a k-1 assignment},
author = {Svante Linusson and Johan Waestlund},
journal= {arXiv preprint arXiv:math/0410347},
year = {2007}
}
Comments
8 pages