AN EFFICIENT ALGORITHM FOR THE BIPARTITE MATCHING PROBLEM

被引:3
|
作者
CARRARESI, P [1 ]
SODINI, C [1 ]
机构
[1] UNIV PISA,IST MATEMAT FINANZIARIA,I-56100 PISA,ITALY
关键词
D O I
10.1016/0377-2217(86)90218-3
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
引用
收藏
页码:86 / 93
页数:8
相关论文
共 50 条
  • [1] AN O(NLOGN) ALGORITHM FOR THE CONVEX BIPARTITE MATCHING PROBLEM
    GALLO, G
    [J]. OPERATIONS RESEARCH LETTERS, 1984, 3 (01) : 31 - 34
  • [2] A randomized algorithm for the on-line weighted bipartite matching problem
    Csaba, Bela
    Pluhar, Andras
    [J]. JOURNAL OF SCHEDULING, 2008, 11 (06) : 449 - 455
  • [3] A randomized algorithm for the on-line weighted bipartite matching problem
    Béla Csaba
    András Pluhár
    [J]. Journal of Scheduling, 2008, 11 : 449 - 455
  • [4] An Input Sensitive Online Algorithm for the Metric Bipartite Matching Problem
    Nayyar, Krati
    Raghvendra, Sharath
    [J]. 2017 IEEE 58TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2017, : 505 - 515
  • [5] A COMPETITIVE STRONG SPANNING TREE ALGORITHM FOR THE MAXIMUM BIPARTITE MATCHING PROBLEM
    GONZALEZ, J
    LANDAETA, O
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 1995, 8 (02) : 186 - 195
  • [6] An efficient algorithm for the blocked pattern matching problem
    Deng, Fei
    Wang, Lusheng
    Liu, Xiaowen
    [J]. BIOINFORMATICS, 2015, 31 (04) : 532 - 538
  • [7] A local algorithm and its percolation analysis of bipartite z-matching problem
    Zhao, Jin-Hua
    [J]. JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, 2023, 2023 (05):
  • [8] Online total bipartite matching problem
    Shanks, Meghan
    Jacobson, Sheldon H.
    [J]. OPTIMIZATION LETTERS, 2022, 16 (05) : 1411 - 1426
  • [9] On the bipartite unique perfect matching problem
    Hoang, Thanh Minh
    Mahajan, Meena
    Thierauf, Thomas
    [J]. AUTOMATA, LANGUAGES AND PROGRAMMING, PT 1, 2006, 4051 : 453 - 464
  • [10] Online total bipartite matching problem
    Meghan Shanks
    Sheldon H. Jacobson
    [J]. Optimization Letters, 2022, 16 : 1411 - 1426