The \(k\)-separator problem: polyhedra, complexity and approximation results (Q2354313): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10878-014-9753-x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2113048862 / rank | |||
Normal rank | |||
Revision as of 22:43, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The \(k\)-separator problem: polyhedra, complexity and approximation results |
scientific article |
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
