PTAS for densest \(k\)-subgraph in interval graphs (Q261389): Difference between revisions
From MaRDI portal
Normalize DOI. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/S00453-014-9956-7 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S00453-014-9956-7 / rank | |||
Normal rank | |||
Latest revision as of 12:48, 9 December 2024
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
