Approximation for combinatorial network optimisation using Tsallis entropy

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review

View graph of relations



Original languageEnglish
Pages (from-to)882-883
Journal / PublicationElectronics Letters
Issue number14
Publication statusPublished - 4 Jul 2013
Externally publishedYes


Recent research shows that a combinatorial network optimisation problem can be approximated by adding a Shannon entropy term to its objective function. This Letter generalises it to the case of Tsallis entropy and provides the mathematical proof.