Solving a centralized dynamic group key management problem by an optimization approach

DOI10.1007/978-3-030-92666-3_32MaRDI QIDQ6629060

Thi Tuyet Trinh Nguyen, Hoai An Le Thi, Hoang Phuc Hau Luu

Publication date: 29 October 2024

zbMATH Keywords

DCAcombinatorial optimizationDC programmingcentralized group key management

Mathematics Subject Classification ID

Communication theory (94A05)

Cites Work

• DC approximation approaches for sparse optimization
• Feature selection in machine learning: an exact penalty approach using a difference of convex function algorithm
• Convex analysis approach to d. c. programming: Theory, algorithms and applications
• DC programming and DCA: thirty years of developments
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
• A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
• Dynamic Balanced Key Tree Management for Secure Multicast Communications

This page was built for publication: Solving a centralized dynamic group key management problem by an optimization approach

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