@InProceedings{chandrasekaran_et_al:LIPIcs.APPROX/RANDOM.2024.9,
author = {Chandrasekaran, Karthekeyan and Chekuri, Chandra and Torres, Manuel R. and Zhu, Weihao},
title = {{On the Generalized Mean Densest Subgraph Problem: Complexity and Algorithms}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2024)},
pages = {9:1--9:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-348-5},
ISSN = {1868-8969},
year = {2024},
volume = {317},
editor = {Kumar, Amit and Ron-Zewi, Noga},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2024.9},
URN = {urn:nbn:de:0030-drops-210025},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2024.9},
annote = {Keywords: Densest subgraph problem, Hardness of approximation, Approximation algorithms}
}