A simpler linear time \( \frac{2}{3} - \varepsilon\) approximation for maximum weight matching (Q2390325): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4426349 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A simple approximation algorithm for the weighted matching problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3138921 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Faster Scaling Algorithms for Network Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Faster scaling algorithms for general graph matching problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4251057 / rank | |||
Normal rank |
Latest revision as of 20:02, 1 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A simpler linear time \( \frac{2}{3} - \varepsilon\) approximation for maximum weight matching |
scientific article |
Statements
A simpler linear time \( \frac{2}{3} - \varepsilon\) approximation for maximum weight matching (English)
0 references
21 July 2009
0 references
matching
0 references
maximum weight matching
0 references
approximation
0 references
analysis of algorithms
0 references
0 references