A characterization of linearizable instances of the quadratic minimum spanning tree problem (Q1702825)
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 6845574
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A characterization of linearizable instances of the quadratic minimum spanning tree problem |
scientific article; zbMATH DE number 6845574 |
Statements
A characterization of linearizable instances of the quadratic minimum spanning tree problem (English)
0 references
1 March 2018
0 references
minimum spanning tree
0 references
quadratic \(0-1\) problems
0 references
quadratic minimum spanning tree
0 references
polynomially solvable cases
0 references
linearization
0 references
0 references
0 references
0 references
0.8286770582199097
0 references
0.8160672187805176
0 references
0.8103165626525879
0 references
0.7965047359466553
0 references
