• DocumentCode
    1806965
  • Title

    Efficient approximation algorithms for the maximum weight matching problem

  • Author

    Takafuji, Daisuke ; Taoka, Satoshi ; Watanabe, Toshimasa

  • Author_Institution
    Graduate Sch. of Eng., Hiroshima Univ., Japan
  • Volume
    4
  • fYear
    2002
  • fDate
    2002
  • Abstract
    The maximum weight matching problem (MWM) is to find a maximum weight matching of a given graph. Although an O(|V|3) or O(|V|4) time algorithm for finding an optimum solution to MWM is known, it takes an extremely long computation time when the size of a graph becomes large. This paper proposes two approximation algorithms Avis+ and LAM+ for MWM, and their usefulness is shown through experimental results: they run fast and produce sharp approximate solutions.
  • Keywords
    graph theory; integrated circuit interconnections; optimisation; Avis+; LAM+; edge-weighted undirected graph; efficient approximation algorithms; graph weight matching; maximum weight matching problem; via minimization problem; Approximation algorithms; Facsimile; Joining processes; Polynomials;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Circuits and Systems, 2002. ISCAS 2002. IEEE International Symposium on
  • Print_ISBN
    0-7803-7448-7
  • Type

    conf

  • DOI
    10.1109/ISCAS.2002.1010491
  • Filename
    1010491
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1806965