Approximability of partitioning graphs with supply and demand (Q1002107): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:41, 30 January 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
