Greedy splitting algorithms for approximating multiway partition problems (Q1769071)
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: Greedy splitting algorithms for approximating multiway partition problems |
scientific article; zbMATH DE number 2146830
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Greedy splitting algorithms for approximating multiway partition problems |
scientific article; zbMATH DE number 2146830 |
Statements
Greedy splitting algorithms for approximating multiway partition problems (English)
0 references
17 March 2005
0 references
Approximation algorithm
0 references
Hypergraph partition
0 references
Multiterminal cut
0 references
Multiway partition problem
0 references
Submodular function
0 references
0 references
0 references
0.9582731127738952
0 references
0.8433515429496765
0 references
0.8415418267250061
0 references
0.8092423677444458
0 references
