On the generalized mean densest subgraph problem: complexity and algorithms

DOI10.4230/LIPICS.APPROX/RANDOM.2024.9MaRDI QIDQ6920837zbMATH OpenFDO

Authors Karthekeyan Chandrasekaran, Chandra Chekuri, Manuel Torres, Weihao Zhu

Publication date 6 October 2025

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

approximation algorithmshardness of approximationdensest subgraph problem

Mathematics Subject Classification ID

Randomized algorithms (68W20) Combinatorial optimization (90C27) Approximation algorithms (68W25)

This page was built for publication: On the generalized mean densest subgraph problem: complexity and algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6920837)