Fully polynomial-time approximation schemes for the max-min connected partition problem on interval graphs (Q2905305)
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: Fully polynomial-time approximation schemes for the max-min connected partition problem on interval graphs |
scientific article; zbMATH DE number 6072543
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fully polynomial-time approximation schemes for the max-min connected partition problem on interval graphs |
scientific article; zbMATH DE number 6072543 |
Statements
27 August 2012
0 references
approximation algorithm
0 references
interval graph
0 references
connected partition
0 references
FPTAS
0 references
Fully polynomial-time approximation schemes for the max-min connected partition problem on interval graphs (English)
0 references
