PTAS for densest \(k\)-subgraph in interval graphs (Q261389)
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: PTAS for densest \(k\)-subgraph in interval graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | PTAS for densest \(k\)-subgraph in interval graphs |
scientific article |
Statements
PTAS for densest \(k\)-subgraph in interval graphs (English)
0 references
23 March 2016
0 references
approximation algorithms
0 references
graph algorithms
0 references
approximation schemes
0 references
interval graphs
0 references
0 references
0 references
0 references
