Matches in SemOpenAlex for { <https://semopenalex.org/work/W4294583981> ?p ?o ?g. }
Showing items 1 to 65 of
65
with 100 items per page.
- W4294583981 abstract "Motivated by the fact that in several cases a matching in a graph is stable if and only if it is produced by a greedy algorithm, we study the problem of computing a maximum weight greedy matching on weighted graphs, termed GreedyMatching. In wide contrast to the maximum weight matching problem, for which many efficient algorithms are known, we prove that GreedyMatching is strongly NP-hard and APX-complete, and thus it does not admit a PTAS unless P=NP, even on graphs with maximum degree at most 3 and with at most three different integer edge weights. Furthermore we prove that GreedyMatching is strongly NP-hard if the input graph is in addition bipartite. Moreover we consider two natural parameters of the problem, for which we establish a sharp threshold behavior between NP-hardness and tractability. On the positive side, we present a randomized approximation algorithm (RGMA) for GreedyMatching on a special class of weighted graphs, called bush graphs. We highlight an unexpected connection between RGMA and the approximation of maximum cardinality matching in unweighted graphs via randomized greedy algorithms. We show that, if the approximation ratio of RGMA is $rho$, then for every $epsilon>0$ the randomized MRG algorithm of [Aronson et al., Rand. Struct. Alg. 1995] gives a $(rho-epsilon)$-approximation for the maximum cardinality matching. We conjecture that a tight bound for $rho$ is $frac{2}{3}$; we prove our conjecture true for two subclasses of bush graphs. Proving a tight bound for the approximation ratio of MRG on unweighted graphs (and thus also proving a tight value for $rho$) is a long-standing open problem [Poloczek and Szegedy; FOCS 2012]. This unexpected relation of our RGMA algorithm with the MRG algorithm may provide new insights for solving this problem." @default.
- W4294583981 created "2022-09-05" @default.
- W4294583981 creator A5011756177 @default.
- W4294583981 creator A5018078197 @default.
- W4294583981 creator A5048361071 @default.
- W4294583981 date "2016-02-18" @default.
- W4294583981 modified "2023-10-18" @default.
- W4294583981 title "On the Complexity of Weighted Greedy Matchings" @default.
- W4294583981 doi "https://doi.org/10.48550/arxiv.1602.05909" @default.
- W4294583981 hasPublicationYear "2016" @default.
- W4294583981 type Work @default.
- W4294583981 citedByCount "0" @default.
- W4294583981 crossrefType "posted-content" @default.
- W4294583981 hasAuthorship W4294583981A5011756177 @default.
- W4294583981 hasAuthorship W4294583981A5018078197 @default.
- W4294583981 hasAuthorship W4294583981A5048361071 @default.
- W4294583981 hasBestOaLocation W42945839811 @default.
- W4294583981 hasConcept C105795698 @default.
- W4294583981 hasConcept C11413529 @default.
- W4294583981 hasConcept C114614502 @default.
- W4294583981 hasConcept C118615104 @default.
- W4294583981 hasConcept C124101348 @default.
- W4294583981 hasConcept C132525143 @default.
- W4294583981 hasConcept C134306372 @default.
- W4294583981 hasConcept C148764684 @default.
- W4294583981 hasConcept C165064840 @default.
- W4294583981 hasConcept C197657726 @default.
- W4294583981 hasConcept C2780990831 @default.
- W4294583981 hasConcept C33923547 @default.
- W4294583981 hasConcept C41008148 @default.
- W4294583981 hasConcept C51823790 @default.
- W4294583981 hasConcept C77553402 @default.
- W4294583981 hasConcept C87117476 @default.
- W4294583981 hasConceptScore W4294583981C105795698 @default.
- W4294583981 hasConceptScore W4294583981C11413529 @default.
- W4294583981 hasConceptScore W4294583981C114614502 @default.
- W4294583981 hasConceptScore W4294583981C118615104 @default.
- W4294583981 hasConceptScore W4294583981C124101348 @default.
- W4294583981 hasConceptScore W4294583981C132525143 @default.
- W4294583981 hasConceptScore W4294583981C134306372 @default.
- W4294583981 hasConceptScore W4294583981C148764684 @default.
- W4294583981 hasConceptScore W4294583981C165064840 @default.
- W4294583981 hasConceptScore W4294583981C197657726 @default.
- W4294583981 hasConceptScore W4294583981C2780990831 @default.
- W4294583981 hasConceptScore W4294583981C33923547 @default.
- W4294583981 hasConceptScore W4294583981C41008148 @default.
- W4294583981 hasConceptScore W4294583981C51823790 @default.
- W4294583981 hasConceptScore W4294583981C77553402 @default.
- W4294583981 hasConceptScore W4294583981C87117476 @default.
- W4294583981 hasLocation W42945839811 @default.
- W4294583981 hasOpenAccess W4294583981 @default.
- W4294583981 hasPrimaryLocation W42945839811 @default.
- W4294583981 hasRelatedWork W107440705 @default.
- W4294583981 hasRelatedWork W1463991495 @default.
- W4294583981 hasRelatedWork W1515825075 @default.
- W4294583981 hasRelatedWork W2002710354 @default.
- W4294583981 hasRelatedWork W2051294918 @default.
- W4294583981 hasRelatedWork W2103599375 @default.
- W4294583981 hasRelatedWork W2579720493 @default.
- W4294583981 hasRelatedWork W2748469983 @default.
- W4294583981 hasRelatedWork W2798321768 @default.
- W4294583981 hasRelatedWork W2952586330 @default.
- W4294583981 isParatext "false" @default.
- W4294583981 isRetracted "false" @default.
- W4294583981 workType "article" @default.