Approximation algorithm for the balanced 2-connected \(k\)-partition problem (Q896161)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Approximation algorithm for the balanced 2-connected k-partition problem |
scientific article; zbMATH DE number 6520548
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithm for the balanced 2-connected \(k\)-partition problem |
scientific article; zbMATH DE number 6520548 |
Statements
Approximation algorithm for the balanced 2-connected \(k\)-partition problem (English)
0 references
11 December 2015
0 references
balanced \(m\)-connected \(k\)-partition
0 references
interval graph
0 references
pseudo-polynomial time algorithm
0 references
FPTAS
0 references
0 references
0.97476983
0 references
0.95569545
0 references
0 references
0 references
0.93111455
0 references
0.91334856
0 references
0.90925777
0 references
0.9078763
0 references
