NP-hardness and approximation algorithms for constrained entropy maximization

DOI10.1109/TIT.2025.3644150MaRDI QIDQ6842427zbMATH OpenFDO

Authors Roberto Bruno, Ugo Vaccaro

Publication date 18 March 2026

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.2025.3644150

Mathematics Subject Classification ID

Information and communication theory, circuits (94-XX)

This page was built for publication: NP-hardness and approximation algorithms for constrained entropy maximization

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