Tim Nonner. PTAS for Densest k-Subgraph in Interval Graphs. In Frank Dehne, John Iacono, Jörg-Rüdiger Sack, editors, Algorithms and Data Structures - 12th International Symposium, WADS 2011, New York, NY, USA, August 15-17, 2011. Proceedings. Volume 6844 of Lecture Notes in Computer Science, pages 631-641, Springer, 2011. [doi]
@inproceedings{Nonner11,
title = {PTAS for Densest k-Subgraph in Interval Graphs},
author = {Tim Nonner},
year = {2011},
doi = {10.1007/978-3-642-22300-6_53},
url = {http://dx.doi.org/10.1007/978-3-642-22300-6_53},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/Nonner11},
cites = {0},
citedby = {0},
pages = {631-641},
booktitle = {Algorithms and Data Structures - 12th International Symposium, WADS 2011, New York, NY, USA, August 15-17, 2011. Proceedings},
editor = {Frank Dehne and John Iacono and Jörg-Rüdiger Sack},
volume = {6844},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-22299-3},
}