On a quadratic programming problem involving distances in trees (Q338937)
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 a quadratic programming problem involving distances in trees |
scientific article; zbMATH DE number 6648467
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On a quadratic programming problem involving distances in trees |
scientific article; zbMATH DE number 6648467 |
Statements
On a quadratic programming problem involving distances in trees (English)
0 references
7 November 2016
0 references
tree
0 references
distance matrix
0 references
quadratic programming problem
0 references
finite metric space
0 references
symmetric bimatrix game
0 references
polynomial time
0 references
Lemke's algorithm
0 references
0 references
0 references
0.9020391
0 references
0.89699507
0 references
0.8940307
0 references
0.89041656
0 references
0.88678205
0 references
0.8836472
0 references
0 references
0 references
