"The Hardness and Approximation of the Densest k-Subgraph Problem in ..."

Shih-Chia Chang et al. (2020)

> Home

Details and statistics

DOI: 10.1109/ICS51289.2020.00034

access: closed

type: Conference or Workshop Paper

metadata version: 2024-10-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/intcompsymp/ChangCHKK20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/intcompsymp/ChangCHKK20
Shih-Chia Chang, Li-Hsuan Chen, Ling-Ju Hung, Shih-Shun Kao, Ralf Klasing:
The Hardness and Approximation of the Densest k-Subgraph Problem in Parameterized Metric Graphs. ICS 2020: 126-130

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.