Assignment problem (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Assignment problem" in English language version.

refsWebsite

Global rank English rank

10doi.org

2^nd place

8worldcat.org

5^th place

5semanticscholar.org

11^th place

8^th place

1hpe.com

low place

1elsevier.com

610^th place

704^th place

1acm.org

1,185^th place

840^th place

1sciencedirect.com

149^th place

178^th place

1stackexchange.com

1,983^rd place

1,330^th place

acm.org

dl.acm.org

Duan, Ran; Pettie, Seth (2014-01-01). "Linear-Time Approximation for Maximum Weight Matching". Journal of the ACM. 61: 1–23. doi:10.1145/2529989. S2CID 207208641.

doi.org

Fredman, Michael L.; Tarjan, Robert Endre (1987-07-01). "Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms". J. ACM. 34 (3): 596–615. doi:10.1145/28869.28874. ISSN 0004-5411. S2CID 7904683.
Kawtikwar, Samiran; Nagi, Rakesh (2024-05-01). "HyLAC: Hybrid linear assignment solver in CUDA". Journal of Parallel and Distributed Computing. 187: 104838. doi:10.1016/j.jpdc.2024.104838. ISSN 0743-7315.
Thorup, Mikkel (2004-11-01). "Integer priority queues with decrease key in constant time and the single source shortest paths problem". Journal of Computer and System Sciences. Special Issue on STOC 2003. 69 (3): 330–353. doi:10.1016/j.jcss.2004.04.003. ISSN 0022-0000.
Gabow, H.; Tarjan, R. (1989-10-01). "Faster Scaling Algorithms for Network Problems". SIAM Journal on Computing. 18 (5): 1013–1036. doi:10.1137/0218069. ISSN 0097-5397.
Goldberg, A.; Kennedy, R. (1997-11-01). "Global Price Updates Help". SIAM Journal on Discrete Mathematics. 10 (4): 551–572. doi:10.1137/S0895480194281185. ISSN 0895-4801.
Orlin, James B.; Ahuja, Ravindra K. (1992-02-01). "New scaling algorithms for the assignment and minimum mean cycle problems". Mathematical Programming. 54 (1–3): 41–56. doi:10.1007/BF01586040. ISSN 0025-5610. S2CID 18213947.
Alfaro, Carlos A.; Perez, Sergio L.; Valencia, Carlos E.; Vargas, Marcos C. (2022-06-01). "The assignment problem revisited". Optimization Letters. 16 (5): 1531–1548. doi:10.1007/s11590-021-01791-4. ISSN 1862-4480. S2CID 238644205.
Mulmuley, Ketan; Vazirani, Umesh; Vazirani, Vijay (1987). "Matching is as easy as matrix inversion". Combinatorica. 7 (1): 105–113. doi:10.1007/BF02579206. S2CID 47370049.
Duan, Ran; Pettie, Seth (2014-01-01). "Linear-Time Approximation for Maximum Weight Matching". Journal of the ACM. 61: 1–23. doi:10.1145/2529989. S2CID 207208641.
Zhu, Haibin; Liu, Dongning; Zhang, Siqin; Zhu, Yu; Teng, Luyao; Teng, Shaohua (2016-03-07). "Solving the Many to Many assignment problem by improving the Kuhn–Munkres algorithm with backtracking". Theoretical Computer Science. 618: 30–41. doi:10.1016/j.tcs.2016.01.002. ISSN 0304-3975.

elsevier.com

linkinghub.elsevier.com

Kawtikwar, Samiran; Nagi, Rakesh (2024-05-01). "HyLAC: Hybrid linear assignment solver in CUDA". Journal of Parallel and Distributed Computing. 187: 104838. doi:10.1016/j.jpdc.2024.104838. ISSN 0743-7315.

hpe.com

labs.hpe.com

Lyle Ramshaw, Robert E. Tarjan (2012). "On minimum-cost assignments in unbalanced bipartite graphs" (PDF). HP research labs.

sciencedirect.com

Zhu, Haibin; Liu, Dongning; Zhang, Siqin; Zhu, Yu; Teng, Luyao; Teng, Shaohua (2016-03-07). "Solving the Many to Many assignment problem by improving the Kuhn–Munkres algorithm with backtracking". Theoretical Computer Science. 618: 30–41. doi:10.1016/j.tcs.2016.01.002. ISSN 0304-3975.

semanticscholar.org

api.semanticscholar.org

Fredman, Michael L.; Tarjan, Robert Endre (1987-07-01). "Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms". J. ACM. 34 (3): 596–615. doi:10.1145/28869.28874. ISSN 0004-5411. S2CID 7904683.
Orlin, James B.; Ahuja, Ravindra K. (1992-02-01). "New scaling algorithms for the assignment and minimum mean cycle problems". Mathematical Programming. 54 (1–3): 41–56. doi:10.1007/BF01586040. ISSN 0025-5610. S2CID 18213947.
Alfaro, Carlos A.; Perez, Sergio L.; Valencia, Carlos E.; Vargas, Marcos C. (2022-06-01). "The assignment problem revisited". Optimization Letters. 16 (5): 1531–1548. doi:10.1007/s11590-021-01791-4. ISSN 1862-4480. S2CID 238644205.
Mulmuley, Ketan; Vazirani, Umesh; Vazirani, Vijay (1987). "Matching is as easy as matrix inversion". Combinatorica. 7 (1): 105–113. doi:10.1007/BF02579206. S2CID 47370049.
Duan, Ran; Pettie, Seth (2014-01-01). "Linear-Time Approximation for Maximum Weight Matching". Journal of the ACM. 61: 1–23. doi:10.1145/2529989. S2CID 207208641.

stackexchange.com

cs.stackexchange.com

D.W. "High-multiplicity maximum-weight matching". Computer Science Stack Exchange. Retrieved 2025-01-15.

worldcat.org

search.worldcat.org

Fredman, Michael L.; Tarjan, Robert Endre (1987-07-01). "Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms". J. ACM. 34 (3): 596–615. doi:10.1145/28869.28874. ISSN 0004-5411. S2CID 7904683.
Kawtikwar, Samiran; Nagi, Rakesh (2024-05-01). "HyLAC: Hybrid linear assignment solver in CUDA". Journal of Parallel and Distributed Computing. 187: 104838. doi:10.1016/j.jpdc.2024.104838. ISSN 0743-7315.
Thorup, Mikkel (2004-11-01). "Integer priority queues with decrease key in constant time and the single source shortest paths problem". Journal of Computer and System Sciences. Special Issue on STOC 2003. 69 (3): 330–353. doi:10.1016/j.jcss.2004.04.003. ISSN 0022-0000.
Gabow, H.; Tarjan, R. (1989-10-01). "Faster Scaling Algorithms for Network Problems". SIAM Journal on Computing. 18 (5): 1013–1036. doi:10.1137/0218069. ISSN 0097-5397.
Goldberg, A.; Kennedy, R. (1997-11-01). "Global Price Updates Help". SIAM Journal on Discrete Mathematics. 10 (4): 551–572. doi:10.1137/S0895480194281185. ISSN 0895-4801.
Orlin, James B.; Ahuja, Ravindra K. (1992-02-01). "New scaling algorithms for the assignment and minimum mean cycle problems". Mathematical Programming. 54 (1–3): 41–56. doi:10.1007/BF01586040. ISSN 0025-5610. S2CID 18213947.
Alfaro, Carlos A.; Perez, Sergio L.; Valencia, Carlos E.; Vargas, Marcos C. (2022-06-01). "The assignment problem revisited". Optimization Letters. 16 (5): 1531–1548. doi:10.1007/s11590-021-01791-4. ISSN 1862-4480. S2CID 238644205.
Zhu, Haibin; Liu, Dongning; Zhang, Siqin; Zhu, Yu; Teng, Luyao; Teng, Shaohua (2016-03-07). "Solving the Many to Many assignment problem by improving the Kuhn–Munkres algorithm with backtracking". Theoretical Computer Science. 618: 30–41. doi:10.1016/j.tcs.2016.01.002. ISSN 0304-3975.