The \(k\)-separator problem: polyhedra, complexity and approximation results (Q2354313)
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 6457772
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The \(k\)-separator problem: polyhedra, complexity and approximation results |
scientific article; zbMATH DE number 6457772 |
Statements
The \(k\)-separator problem: polyhedra, complexity and approximation results (English)
0 references
10 July 2015
0 references
graph partitioning
0 references
complexity theory
0 references
optimization
0 references
approximation algorithms
0 references
polyhedra
0 references
0 references
0 references
0.9726354479789734
0 references
0.8775479197502136
0 references
0.8266012072563171
0 references
0.8234263062477112
0 references
0.8176848888397217
0 references
