A divide-and-conquer local search heuristic for data visualization (Q2499138)
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 5045514
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A divide-and-conquer local search heuristic for data visualization |
scientific article; zbMATH DE number 5045514 |
Statements
A divide-and-conquer local search heuristic for data visualization (English)
0 references
14 August 2006
0 references
data visualization
0 references
discrete optimization
0 references
local search
0 references
multidimensional scaling
0 references
quadratic assignment problem
0 references
0.7041696310043335
0 references
0.7009637355804443
0 references
0.6924888491630554
0 references
0.6890141367912292
0 references
0.6889695525169373
0 references
