On linear and semidefinite programming relaxations for hypergraph matching (Q715088)
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: On linear and semidefinite programming relaxations for hypergraph matching |
scientific article; zbMATH DE number 6093779
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On linear and semidefinite programming relaxations for hypergraph matching |
scientific article; zbMATH DE number 6093779 |
Statements
On linear and semidefinite programming relaxations for hypergraph matching (English)
0 references
15 October 2012
0 references
linear programming
0 references
semidefinite programming
0 references
hypergraph matching
0 references
rounding algorithm
0 references
0 references
0.8300580382347107
0 references
0.8145511150360107
0 references
0.8104175329208374
0 references
0.8057740330696106
0 references
