1 / 5

Substantially subcubic approximation schemes for maximum weight bipartite matching

Substantially subcubic approximation schemes for maximum weight bipartite matching. Cui Di Supervisor: Andrzej Lingas Lund University.

ayvonne
Télécharger la présentation

Substantially subcubic approximation schemes for maximum weight bipartite matching

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Substantially subcubic approximation schemes for maximum weight bipartite matching Cui Di Supervisor: AndrzejLingas Lund University SOFSEM 2010 - SRF

  2. We study the design of relatively fast approximation schemes for maximum weight matching on the base of existing exact algorithms for this problem whose running time is substantially dependent on the maximum edge weight W. The exact algorithms are treated as black box and the general idea of our approach is to eliminate the dependence on W. SOFSEM 2010 - SRF

  3. Two simple transformations of the edge weights in the input graph G such that a maximum weight matching of the resulting graph yields a close approximation of maximum weight matching of G. • A transformation of a hypothetic exact algorithm for maximum weight matching in a hereditary family of graphs into an approximation scheme. The running time of the approximation scheme is close to that of the exact algorithm in case the largest edge weight is . SOFSEM 2010 - SRF

  4. Applications Two approximation schemes for maximum weight matching in a bipartite graph with positive integer edge weights. · One is more practical and runs in time · The other one is randomized, uses fast matrix multiplication and runs in time . • Extensions SOFSEM 2010 - SRF

  5. Thank you! SOFSEM 2010 - SRF

More Related