Efficient Algorithms for Variants of Weighted Matching and Assignment Problems

Abstract.Obtaining a matching in a graph satisfying a certain objective is an important class of graph problems. Matching algorithms have received attention for several decades. However, while there are efficient algorithms to obtain a maximum weight matching, not much is known about the maximum weight maximum cardinality, and maximum cardinality maximum weight matching problems for general graphs. Our contribution in this work is to show that for bounded weight input graphs one can obtain an algorithm for both maximum weight maximum cardinality (for real weights), and maximum cardinality maximum weight matching (for integer weights) by modifying the input and running the existing maximum weight matching algorithm. Also, given the current state of the art in maximum weight matching algorithms, we show that, for bounded weight input graphs, both maximum weight maximum cardinality, and maximum cardinality maximum weight matching have algorithms of similar complexities to that of maximum weight matching. Subsequently, we also obtain approximation algorithms for maximum weight maximum cardinality, and maximum cardinality maximum weight matching.

[1]  René Beier,et al.  A powerful heuristic for telephone gossiping , 2000, SIROCCO.

[2]  Rolf H. Möhring,et al.  Complexity and Modeling Aspects of Mesh Refinement into Quadrilaterals , 1997, ISAAC.

[3]  Allen R. Hanson,et al.  Maximum-weight bipartite matching technique and its application in image feature matching , 1996, Other Conferences.

[4]  Silvio Micali,et al.  Priority queues with variable priority and an O(EV log V) algorithm for finding a maximal weighted matching in general graphs , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[5]  ZVI GALIL,et al.  Efficient algorithms for finding maximum matching in graphs , 1986, CSUR.

[6]  Manolis I. A. Lourakis,et al.  A graph-based approach to corner matching using mutual information as a local similarity measure , 2004, ICPR 2004.

[7]  Peter Sanders,et al.  A simpler linear time 2/3-epsilon approximation for maximum weight matching , 2004, Inf. Process. Lett..

[8]  Marco Ajmone Marsan,et al.  Bounds on delays and queue lengths in input-queued cell switches , 2003, JACM.

[9]  Silvio Micali,et al.  An O(v|v| c |E|) algoithm for finding maximum matching in general graphs , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[10]  Andrew V. Goldberg,et al.  An efficient cost scaling algorithm for the assignment problem , 1995, Math. Program..

[11]  R. Tarjan,et al.  A Separator Theorem for Planar Graphs , 1977 .

[12]  Stefan Hougardy,et al.  A linear-time approximation algorithm for weighted matchings in graphs , 2005, TALG.

[13]  Claus Bauer.  Approximations to maximum weight matching scheduling algorithms of low complexity , 2005, Advanced Industrial Conference on Telecommunications/Service Assurance with Partial and Intermittent Resources Conference/E-Learning on Telecommunications Workshop (AICT/SAPIR/ELETE'05).

[14]  Zvi Galil,et al.  Efficient implementation of graph algorithms using contraction , 1984, JACM.

[15]  S. C. Rison,et al.  A universally applicable method of operon map prediction on minimally annotated genomes using conserved genomic context , 2005, Nucleic acids research.

[16]  Michal Feldman,et al.  A price-anticipating resource allocation mechanism for distributed shared clusters , 2005, EC '05.

[17]  Harold N. Gabow,et al.  Data structures for weighted matching and nearest common ancestors with linking , 1990, SODA '90.

[18]  Robert E. Tarjan,et al.  Faster Scaling Algorithms for Network Problems , 1989, SIAM J. Comput..

[19]  Kurt Mehlhorn,et al.  LEDA: a platform for combinatorial and geometric computing , 1997, CACM.

[20]  Ralf Diekmann,et al.  Quality matching and local improvement for multilevel graph-partitioning , 2000, Parallel Comput..

[21]  F. Makedon,et al.  A bipartite graph matching framework for finding correspondences between structural elements in two proteins , 2004, The 26th Annual International Conference of the IEEE Engineering in Medicine and Biology Society.

[22]  Robert E. Tarjan,et al.  Applications of a planar separator theorem , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[23]  Harold N. Gabow,et al.  An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs , 1976, JACM.

[24]  David Goldberg,et al.  What every computer scientist should know about floating-point arithmetic , 1991, CSUR.

[25]  Olaf Schenk,et al.  Maximum-Weighted Matching Strategies and the Application to Symmetric Indefinite Systems , 2004, PARA.