Matches in SemOpenAlex for { <https://semopenalex.org/work/W2912683485> ?p ?o ?g. }
Showing items 1 to 87 of
87
with 100 items per page.
- W2912683485 abstract "We consider the maximum vertex-weighted matching problem (MVM) for non-bipartite graphs. In earlier work we have described a 2/3-approximation algorithm for the MVM on bipartite graphs (Dobrian, Halappanavar, Pothen and Al-Herz, SIAM J. Scientific Computing, 2019). Here we show that a 2/3-approximation algorithm for MVM on non-bipartite graphs can be obtained by restricting the length of augmenting paths to at most three. The algorithm has time complexity $O(m log Delta + n log n)$, where $n$ is the number of vertices, $m$ is the number of edges, and $Delta$ is the maximum degree of a vertex. The approximation ratio of the algorithm is obtained by considering failed vertices, i.e., vertices that the approximation algorithm fails to match but the exact algorithm does. We show that there are two distinct heavier matched vertices that we can charge each failed vertex to. Our proof techniques characterize the structure of augmenting paths in a novel way. We have implemented the 2/3-approximation algorithm and show that it runs in under a minute on graphs with tens of millions of vertices and hundreds of millions of edges. We compare its performance with five other algorithms: an exact algorithm for MVM, an exact algorithm for the maximum edge-weighted matching (MEM) problem, as well as three approximation algorithms. In our test set of nineteen problems, there are graphs on which the exact algorithms fail to terminate in 100 hours. The new 2/3-approximation algorithm for MVM outperforms the other approximation algorithms by either being faster (often by orders of magnitude) or obtaining better weights." @default.
- W2912683485 created "2019-02-21" @default.
- W2912683485 creator A5003687723 @default.
- W2912683485 creator A5055182869 @default.
- W2912683485 date "2019-02-15" @default.
- W2912683485 modified "2023-09-27" @default.
- W2912683485 title "A 2/3-Approximation Algorithm for Vertex-weighted Matching" @default.
- W2912683485 cites W113754518 @default.
- W2912683485 cites W118651885 @default.
- W2912683485 cites W1485041102 @default.
- W2912683485 cites W1541173915 @default.
- W2912683485 cites W1563315847 @default.
- W2912683485 cites W1588435862 @default.
- W2912683485 cites W1981864217 @default.
- W2912683485 cites W1990025588 @default.
- W2912683485 cites W2014533003 @default.
- W2912683485 cites W2021642912 @default.
- W2912683485 cites W2024106841 @default.
- W2912683485 cites W2035080386 @default.
- W2912683485 cites W2037576616 @default.
- W2912683485 cites W2047281923 @default.
- W2912683485 cites W2069849438 @default.
- W2912683485 cites W2093992309 @default.
- W2912683485 cites W2138508044 @default.
- W2912683485 cites W2144856557 @default.
- W2912683485 cites W2153752762 @default.
- W2912683485 cites W2156153879 @default.
- W2912683485 cites W2318939604 @default.
- W2912683485 cites W2544746413 @default.
- W2912683485 cites W2963813330 @default.
- W2912683485 cites W2988480584 @default.
- W2912683485 hasPublicationYear "2019" @default.
- W2912683485 type Work @default.
- W2912683485 sameAs 2912683485 @default.
- W2912683485 citedByCount "0" @default.
- W2912683485 crossrefType "posted-content" @default.
- W2912683485 hasAuthorship W2912683485A5003687723 @default.
- W2912683485 hasAuthorship W2912683485A5055182869 @default.
- W2912683485 hasConcept C105795698 @default.
- W2912683485 hasConcept C11413529 @default.
- W2912683485 hasConcept C114614502 @default.
- W2912683485 hasConcept C118615104 @default.
- W2912683485 hasConcept C132525143 @default.
- W2912683485 hasConcept C148764684 @default.
- W2912683485 hasConcept C165064840 @default.
- W2912683485 hasConcept C197657726 @default.
- W2912683485 hasConcept C33923547 @default.
- W2912683485 hasConcept C40687702 @default.
- W2912683485 hasConcept C80899671 @default.
- W2912683485 hasConceptScore W2912683485C105795698 @default.
- W2912683485 hasConceptScore W2912683485C11413529 @default.
- W2912683485 hasConceptScore W2912683485C114614502 @default.
- W2912683485 hasConceptScore W2912683485C118615104 @default.
- W2912683485 hasConceptScore W2912683485C132525143 @default.
- W2912683485 hasConceptScore W2912683485C148764684 @default.
- W2912683485 hasConceptScore W2912683485C165064840 @default.
- W2912683485 hasConceptScore W2912683485C197657726 @default.
- W2912683485 hasConceptScore W2912683485C33923547 @default.
- W2912683485 hasConceptScore W2912683485C40687702 @default.
- W2912683485 hasConceptScore W2912683485C80899671 @default.
- W2912683485 hasLocation W29126834851 @default.
- W2912683485 hasOpenAccess W2912683485 @default.
- W2912683485 hasPrimaryLocation W29126834851 @default.
- W2912683485 hasRelatedWork W1482102823 @default.
- W2912683485 hasRelatedWork W1518653692 @default.
- W2912683485 hasRelatedWork W1528077854 @default.
- W2912683485 hasRelatedWork W1592124149 @default.
- W2912683485 hasRelatedWork W1709205181 @default.
- W2912683485 hasRelatedWork W1781900113 @default.
- W2912683485 hasRelatedWork W1992060486 @default.
- W2912683485 hasRelatedWork W2068727363 @default.
- W2912683485 hasRelatedWork W2081642962 @default.
- W2912683485 hasRelatedWork W2168519036 @default.
- W2912683485 hasRelatedWork W2407583267 @default.
- W2912683485 hasRelatedWork W2584943837 @default.
- W2912683485 hasRelatedWork W2594795300 @default.
- W2912683485 hasRelatedWork W2752747244 @default.
- W2912683485 hasRelatedWork W2799145821 @default.
- W2912683485 hasRelatedWork W2921999720 @default.
- W2912683485 hasRelatedWork W2945402626 @default.
- W2912683485 hasRelatedWork W2963874686 @default.
- W2912683485 hasRelatedWork W2980567354 @default.
- W2912683485 hasRelatedWork W124627512 @default.
- W2912683485 isParatext "false" @default.
- W2912683485 isRetracted "false" @default.
- W2912683485 magId "2912683485" @default.
- W2912683485 workType "article" @default.