Conceptio › Archive › HAL (France)
HAL (France)open access

On the Hardness and Approximation of the Densest k-Subgraph Problem in Parameterized Metric Graphs *

Shih-Chia Chang et al.
HAL (France) · Papers · License: Open Access
Open Source ↗
0, 1, Densest k-subgraph, Inapproximability, Parameterized metric graph, Approximation algorithm
This document is indexed with metadata only — full text is not available in the archive for this record. Open the official source ↗
Record · ID 796467
Retrieved via Conceptio — every document is proof-bundled with source, license, and retrieval metadata.