Constructive Heuristics and Lower Bounds for Graph Partitioning Based on a Principal-Components Approximation (Q3142604)
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 446918
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Constructive Heuristics and Lower Bounds for Graph Partitioning Based on a Principal-Components Approximation |
scientific article; zbMATH DE number 446918 |
Statements
Constructive Heuristics and Lower Bounds for Graph Partitioning Based on a Principal-Components Approximation (English)
0 references
4 January 1994
0 references
graph partitioning
0 references
geometric clustering
0 references
rank reduction
0 references
eigendecomposition
0 references
strongly separated partitions
0 references
NP-hard
0 references
principal components
0 references
lower bounds
0 references
0.848700761795044
0 references
0.8227387070655823
0 references
0.8122504353523254
0 references
