SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Random Structures and Algorithms

Volumn 26, Issue 1-2, 2005, Pages 237-251

A proof of a conjecture of Buck, Chan, and Robbins on the expected value of the minimum assignment

(1) Wästlund, Johan a

a LINKÖPING UNIVERSITY (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 22144438970 PISSN: 10429832 EISSN: None Source Type: Journal
DOI: 10.1002/rsa.20066 Document Type: Conference Paper

Times cited : (17)

References (17)

1
- 21144467237
- Asymptotics in the random assignment problem
- D. Aldous, Asymptotics in the random assignment problem, Probab. Theory Relat. Fields, 93 (1992), 507-534.
- (1992) Probab. Theory Relat. Fields , vol.93 , pp. 507-534
- Aldous, D.¹

2
- 0035626635
- The ζ (2) limit in the random assignment problem
- D. Aldous, The ζ (2) limit in the random assignment problem, Random Structures Algorithms 18(4) (2001), 381-418.
- (2001) Random Structures Algorithms , vol.18 , Issue.4 , pp. 381-418
- Aldous, D.¹

3
- 0036016669
- Exact expectations and distributions in the random assignment problem
- S. E. Alm and G. B. Sorkin, Exact expectations and distributions in the random assignment problem, Combin Probab Comput 11(3) (2002), 217-248.
- (2002) Combin Probab Comput , vol.11 , Issue.3 , pp. 217-248
- Alm, S.E.¹ Sorkin, G.B.²

4
- 0036338965
- On the expected value of the minimum assignment
- M. W. Buck, C. S. Chan, and D. P. Robbins, On the expected value of the minimum assignment, Random Structures Algorithms 21(1) (2002), 33-58.
- (2002) Random Structures Algorithms , vol.21 , Issue.1 , pp. 33-58
- Buck, M.W.¹ Chan, C.S.² Robbins, D.P.³

5
- 0033424378
- Constructive bounds and exact expectations for the random assignment problem
- D. Coppersmith and G. B. Sorkin, Constructive Bounds and Exact Expectations For the Random Assignment Problem, Random Structures Algorithms 15 (1999), 133-144.
- (1999) Random Structures Algorithms , vol.15 , pp. 133-144
- Coppersmith, D.¹ Sorkin, G.B.²

6
- 1542743752
- On the expected incremental cost of a minimum assignment, Contemporary mathematics
- Ed. B. Bollobás, Springer, Berlin
- D. Coppersmith and G. B. Sorkin, On the expected incremental cost of a minimum assignment, Contemporary mathematics Ed. B. Bollobás, Vol. 10 of Bolyai Society Mathematical Studies. Springer, Berlin, 2002, pp. 277-288.
- (2002) Bolyai Society Mathematical Studies , vol.10 , pp. 277-288
- Coppersmith, D.¹ Sorkin, G.B.²

7
- 0040254756
- A lower bound on the expected cost of an optimal assignment
- M. X. Goemans and M. S. Kodialam, A lower bound on the expected cost of an optimal assignment, Math Oper Res 18 (1993), 267-274.
- (1993) Math Oper Res , vol.18 , pp. 267-274
- Goemans, M.X.¹ Kodialam, M.S.²

8
- 0012833041
- An upper bound on the expected cost of an optimal assignment
- Academic Press, New York
- R. M. Karp, An upper bound on the expected cost of an optimal assignment, Discrete Algorithms and Complexity: Proc Japan-U.S. Joint Sem, Academic Press, New York, 1987, pp. 1-4.
- (1987) Discrete Algorithms and Complexity: Proc Japan-U.S. Joint Sem , pp. 1-4
- Karp, R.M.¹

9
- 0012771214
- Certain expected values in the random assignment problem
- A. Lazarus, Certain expected values in the random assignment problem, Oper Res Lett 14 (1993), 207-214.
- (1993) Oper Res Lett , vol.14 , pp. 207-214
- Lazarus, A.¹

10
- 0242305807
- arXiv:math. CO/0006146
- S. Linusson and J. Wästlund, A generalization of the random assignment problem, arXiv:math. CO/0006146.
- A Generalization of the Random Assignment Problem
- Linusson, S.¹ Wästlund, J.²

11
- 12144287806
- A proof of Parisi's conjecture on the random assignment problem
- S. Linusson and J. Wästlund, A proof of Parisi's conjecture on the random assignment problem, Probab Theory Related Fields 128 (2004), 419-440.
- (2004) Probab Theory Related Fields , vol.128 , pp. 419-440
- Linusson, S.¹ Wästlund, J.²

12
- 0038363049
- North-Holland, Amsterdam
- L. Lovász and M. D. Plummer, Matching theory, North-Holland, Amsterdam, 1986.
- (1986) Matching Theory
- Lovász, L.¹ Plummer, M.D.²

13
- 0347058873
- Replicas and optimization
- M. Mézard and G. Parisi, Replicas and optimization, J Phys Lett 46 (1985), 771-778.
- (1985) J Phys Lett , vol.46 , pp. 771-778
- Mézard, M.¹ Parisi, G.²

14
- 84943419844
- Proofs of the Parisi and Coppersmith-Sorkin conjectures for the finite random assignment problem
- C. Nair, B. Prabhakar, and M. Sharma, Proofs of the Parisi and Coppersmith-Sorkin conjectures for the finite random assignment problem, Proc. IEEE FOCS, 2003, 168-178.
- (2003) Proc. IEEE FOCS , pp. 168-178
- Nair, C.¹ Prabhakar, B.² Sharma, M.³

15
- 0012830842
- Ph.D. thesis, Kungl Tekniska Högskolan, Stockholm, Sweden
- B. Olin, Asymptotic properties of the random assignment problem, Ph.D. thesis, Kungl Tekniska Högskolan, Stockholm, Sweden, 1992.
- (1992) Asymptotic Properties of the Random Assignment Problem
- Olin, B.¹

16
- 0004049418
- arXiv:cond-mat/9801176
- G. Parisi, A conjecture on random bipartite matching, arXiv:cond-mat/9801176, 1998.
- (1998) A Conjecture on Random Bipartite Matching
- Parisi, G.¹

17
- 0012523229
- On the expected value of a random assignment problem
- D. W. Walkup, On the expected value of a random assignment problem, SIAM J Comput 8 (1979), 440-442.
- (1979) SIAM J Comput , vol.8 , pp. 440-442
- Walkup, D.W.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.