HAL (France)
open access
On the Hardness and Approximation of the Densest k-Subgraph Problem in Parameterized Metric Graphs *
A complete weighted graph is called -metric, for some , if G satisfies the -triangle inequality, i.e., for all vertices . Given a -metric graph , the -Weighted Densest k-Subgraph (-WDkS) problem is to find an induced subgraph G[C] with exactly k vertices such that the total edge weight of G[C] is ma
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Extremal problems for cancellative and locally thin hypergraphs#986484
- Efficiently Listing Projected Trees, and Equivalence of Listing and Enumeration#1156377
- Algorithmic Lower Bounds: Fun with Hardness Proofs#3416
- A Survey of Densest Subgraph Discovery on Large Graphs#820128
- Algorithms for packing and covering problems#818515
Record · ID 796467
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive