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 the normal view instead:
scientific article; zbMATH DE number 6559791
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | PTAS for densest \(k\)-subgraph in interval graphs |
scientific article; zbMATH DE number 6559791 |
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
0 references
0.999023973941803
0 references
0.850734531879425
0 references
0.8376324772834778
0 references
0.827849805355072
0 references
0.8000860214233398
0 references
