Approximability of partitioning graphs with supply and demand (Q1002107): 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.1016/j.jda.2008.03.002 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2172083980 / rank | |||
Normal rank | |||
Revision as of 00:52, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximability of partitioning graphs with supply and demand |
scientific article |
Statements
Approximability of partitioning graphs with supply and demand (English)
0 references
23 February 2009
0 references
approximation algorithm
0 references
demand
0 references
FPTAS
0 references
graph partition problem
0 references
MAXSNP-hard
0 references
series-parallel graph
0 references
supply
0 references
