Top-k Overlapping Densest Subgraphs: Approximation and Complexity

Riccardo Dondi, Mohammad Mehdi Hosseinzadeh, Giancarlo Mauri, Italo Zoppis. Top-k Overlapping Densest Subgraphs: Approximation and Complexity. In Alessandra Cherubini, Nicoletta Sabadini, Simone Tini, editors, Proceedings of the 20th Italian Conference on Theoretical Computer Science, ICTCS 2019, Como, Italy, September 9-11, 2019. Volume 2504 of CEUR Workshop Proceedings, pages 110-121, CEUR-WS.org, 2019. [doi]

@inproceedings{DondiHMZ19,
  title = {Top-k Overlapping Densest Subgraphs: Approximation and Complexity},
  author = {Riccardo Dondi and Mohammad Mehdi Hosseinzadeh and Giancarlo Mauri and Italo Zoppis},
  year = {2019},
  url = {http://ceur-ws.org/Vol-2504/paper14.pdf},
  researchr = {https://researchr.org/publication/DondiHMZ19},
  cites = {0},
  citedby = {0},
  pages = {110-121},
  booktitle = {Proceedings of the 20th Italian Conference on Theoretical Computer Science, ICTCS 2019, Como, Italy, September 9-11, 2019},
  editor = {Alessandra Cherubini and Nicoletta Sabadini and Simone Tini},
  volume = {2504},
  series = {CEUR Workshop Proceedings},
  publisher = {CEUR-WS.org},
}