MathSciNet Relay Station
MathSciNet bibliographic data
MR910922 90C10
Karp, Richard M. An upper bound on the expected cost of an optimal assignment. Discrete algorithms and complexity (Kyoto, 1986), 1–4, Perspect. Comput., 15, Academic Press, Boston, MA, 1987.
For users without a MathSciNet license , Relay Station allows linking from MR numbers in online mathematical literature directly to electronic journals and original articles. Subscribers receive the added value of full MathSciNet reviews.

Username/Password Subscribers access MathSciNet here

AMS Home Page

American Mathematical Society American Mathematical Society
201 Charles Street
Providence, RI 02904-6248 USA
© Copyright 2016, American Mathematical Society
Privacy Statement