A class of bounded approximation algorithms for graph partitioning (Q3474493)
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: Publication:3474493 |
scientific article; zbMATH DE number 4141823
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A class of bounded approximation algorithms for graph partitioning |
scientific article; zbMATH DE number 4141823 |
Statements
A class of bounded approximation algorithms for graph partitioning (English)
0 references
1990
0 references
heuristic
0 references
Graph partitioning
0 references
weighted graph
0 references
equal-sized disjoint subsets
0 references
bounded approximation algorithms
0 references
heuristics
0 references
matching
0 references
0.8402667045593262
0 references
0.817509114742279
0 references
0.807388424873352
0 references
