Linear programming based approximation for unweighted induced matchings -- breaking the \(\varDelta\) barrier (Q2218644)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Linear programming based approximation for unweighted induced matchings -- breaking the barrier |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Linear programming based approximation for unweighted induced matchings -- breaking the \(\varDelta\) barrier |
scientific article |
Statements
Linear programming based approximation for unweighted induced matchings -- breaking the \(\varDelta\) barrier (English)
0 references
15 January 2021
0 references
induced matching
0 references
strong matching
0 references
approximation algorithm
0 references
linear programming
0 references
primal-dual approximation algorithm
0 references
0.8597043752670288
0 references
0.8151060938835144
0 references
0.7981513142585754
0 references
0.7951667904853821
0 references
0.7900672554969788
0 references
