Approximation algorithms for \(k\)-partitioning problems with partition matroid constraint (Q2448182)
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 6290467
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithms for \(k\)-partitioning problems with partition matroid constraint |
scientific article; zbMATH DE number 6290467 |
Statements
Approximation algorithms for \(k\)-partitioning problems with partition matroid constraint (English)
0 references
30 April 2014
0 references
partition matroid
0 references
approximation algorithm
0 references
efficient polynomial time approximation scheme (EPTAS)
0 references
full polynomial time approximation scheme (FPTAS)
0 references
0 references
0.9149848222732544
0 references
0.8823828101158142
0 references
0.8720522522926331
0 references
0.8289306163787842
0 references
0.8288902044296265
0 references
