1. Главная
  2. Ресурсы
  3. Библиотечный поиск
A proof of aconjecture of Buck,Chan, and Robbins onthe expected value ofthe minimumassignment Johan Wästlund2005 год

A proof of a conjecture of Buck, Chan, and Robbins on the expected value of the minimum assignment
статья из журнала

Страница публикацииПубликация в OpenAlex
Аннотация: Abstract 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 Algorithms 21 (2002), 33–58]. This is an exact formula for the expected value of a certain type of random assignment problem. It generalizes the formula 1 + 1/4 + … 1/ n 2 for the n by n exp(1) random assignment problem. © 2005 Wiley Periodicals, Inc. Random Struct. Alg., 2005
Год издания: 2005
Авторы: Johan Wästlund
Издательство: Wiley
Источник: Random Structures and Algorithms
Ключевые слова: Complexity and Algorithms in Graphs, Advanced Graph Theory Research, Algorithms and Data Compression