FINDING A COMPLETE MATCHING WITH THE MAXIMUM PRODUCT ON WEIGHTED BIPARTITE GRAPHS

被引：0
|
作者：
TSENG, FSC
YANG, WP
CHEN, ALP
机构：
[1] NATL TSING HUA UNIV,DEPT COMP SCI,HSINCHU 30043,TAIWAN
[2] NATL CHIAO TUNG UNIV,DEPT COMP SCI & INFORMAT ENGN,HSINCHU 30050,TAIWAN
来源：
COMPUTERS & MATHEMATICS WITH APPLICATIONS | 1993年 / 25卷 / 05期
关键词：
D O I：
10.1016/0898-1221(93)90199-6
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
The traditional bipartite weighted matching problem is to maximize the largest possible sum of weights. In this paper, we define a bipartite matching problem which maximizes the largest possible product of weights and develop an algorithm to solve it. Although this problem corresponds to a non-linear program, we show this problem can be easily solved by modifying the Hungarian method. Finally, we present an application of this problem.
引用
收藏
页码：65 / 71
页数：7
相关论文
共 50 条
  • [41] Computing maximum non-crossing matching in convex bipartite graphs
    Chen, Danny Z.
    Liu, Xiaomin
    Wang, Haitao
    DISCRETE APPLIED MATHEMATICS, 2015, 187 : 50 - 60
  • [42] Algorithms for maximum matching and minimum fill-in on chordal bipartite graphs
    Chang, MS
    ALGORITHMS AND COMPUTATION, 1996, 1178 : 146 - 155
  • [43] Offensive Positioning Based on Maximum Weighted Bipartite Matching and Voronoi Diagram
    Malmir, Mohammadhossein
    Boluki, Shahin
    Ghidary, Saeed Shiry
    ROBOCUP 2014: ROBOT WORLD CUP XVIII, 2015, 8992 : 562 - 570
  • [44] Graham's pebbling conjecture on product of complete bipartite graphs
    冯荣权
    金珠英
    Science China Mathematics, 2001, (07) : 817 - 822
  • [45] Distributed-Memory Algorithms for Maximum Cardinality Matching in Bipartite Graphs
    Azad, Ariful
    Buluc, Aydin
    2016 IEEE 30TH INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM (IPDPS 2016), 2016, : 32 - 42
  • [46] A Parallel Tree Grafting Algorithm for Maximum Cardinality Matching in Bipartite Graphs
    Azad, Ariful
    Buluc, Aydin
    Pothen, Alex
    2015 IEEE 29TH INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM (IPDPS), 2015, : 1075 - 1084
  • [47] An Optimum Lower Bound for the Weights of Maximum Weight Matching in Bipartite Graphs
    Das, Shibsankar
    SCIENTIFIC ANNALS OF COMPUTER SCIENCE, 2020, 30 (01) : 25 - 37
  • [48] GraPacking Bipartite Graphs with Covers of Complete Bipartite Graphs
    Chalopin, Jeremie
    Paulusma, Daniel
    ALGORITHMS AND COMPLEXITY, PROCEEDINGS, 2010, 6078 : 276 - +
  • [49] Packing bipartite graphs with covers of complete bipartite graphs
    Chalopin, Jeremie
    Paulusma, Daniel
    DISCRETE APPLIED MATHEMATICS, 2014, 168 : 40 - 50
  • [50] Maximum vertex-weighted matching in strongly chordal graphs
    Campelo, MB
    Klein, S
    DISCRETE APPLIED MATHEMATICS, 1998, 84 (1-3) : 71 - 77
12345