Approximability of partitioning graphs with supply and demand (Q1002107)
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 5509893
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximability of partitioning graphs with supply and demand |
scientific article; zbMATH DE number 5509893 |
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
0.9845269918441772
0 references
0.9092498421669006
0 references
0.8334882855415344
0 references
0.8328368663787842
0 references
