Densest k-Subgraph Approximation on Intersection Graphs
From MaRDI portal
Publication:3075452
DOI10.1007/978-3-642-18318-8_8zbMath1314.68393OpenAlexW1519679194MaRDI QIDQ3075452
Danny Z. Chen, Rudolf Fleischer, Jian Li
Publication date: 15 February 2011
Published in: Approximation and Online Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-18318-8_8
Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items
Strengthening ties towards a highly-connected world ⋮ Approximation of the Quadratic Knapsack Problem ⋮ Finding connected \(k\)-subgraphs with high density ⋮ Finding Connected Dense $$k$$-Subgraphs ⋮ On the \(k\)-edge-incident subgraph problem and its variants ⋮ In search of the densest subgraph ⋮ Approximating the \textsc{Sparsest} \(k\)-\textsc{Subgraph} in chordal graphs ⋮ PTAS for densest \(k\)-subgraph in interval graphs
This page was built for publication: Densest k-Subgraph Approximation on Intersection Graphs
