Max-min greedy matching problem: hardness for the adversary and fractional variant (Q6535803)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7810584
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Max-min greedy matching problem: hardness for the adversary and fractional variant |
scientific article; zbMATH DE number 7810584 |
Statements
Max-min greedy matching problem: hardness for the adversary and fractional variant (English)
0 references
28 February 2024
0 references
max-min greedy matching
0 references
adversarial hardness
0 references
fractional matching
0 references
0 references
0 references
0.9512569308280944
0 references
0.8082557916641235
0 references
0.7600306868553162
0 references
0.7323996424674988
0 references
