PTAS for Densest k-Subgraph in Interval Graphs

DOI10.1007/978-3-642-22300-6_53zbMath1336.68299OpenAlexW1887950748MaRDI QIDQ5199279

Tim Nonner

Publication date: 12 August 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22300-6_53

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (3)

Finding connected \(k\)-subgraphs with high density ⋮ On the \(k\)-edge-incident subgraph problem and its variants ⋮ Approximating the \textsc{Sparsest} \(k\)-\textsc{Subgraph} in chordal graphs

This page was built for publication: PTAS for Densest k-Subgraph in Interval Graphs