• DocumentCode
    2183806
  • Title

    Interior-point methods in parallel computation

  • Author

    Goldberg, Andrew V. ; Shmoys, David B. ; Plotkin, Serge A. ; Tardos, Éva

  • Author_Institution
    Stanford Univ, CA, USA
  • fYear
    1989
  • fDate
    30 Oct-1 Nov 1989
  • Firstpage
    350
  • Lastpage
    355
  • Abstract
    Interior-point methods for linear programming, developed in the context of sequential computation, are used to obtain a parallel algorithm for the bipartite matching problem. The algorithm runs in O*(√m) time. The results extend to the weighted bipartite matching problem and to the zero-one minimum-cost flow problem, yielding O*(√m log C) algorithms. This improves previous bounds on these problems and illustrates the importance of interior-point methods in parallel algorithm design
  • Keywords
    linear programming; parallel algorithms; bipartite matching problem; interior-point methods; linear programming; parallel algorithm; Algorithm design and analysis; Bipartite graph; Concurrent computing; Contracts; Costs; Linear programming; Operations research; Parallel algorithms; Sun; Uninterruptible power systems;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Foundations of Computer Science, 1989., 30th Annual Symposium on
  • Conference_Location
    Research Triangle Park, NC
  • Print_ISBN
    0-8186-1982-1
  • Type

    conf

  • DOI
    10.1109/SFCS.1989.63502
  • Filename
    63502
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2183806