Markov Approximation for Combinatorial Network Optimization

DOI10.1109/TIT.2013.2268923MaRDI QIDQ5346289zbMATH OpenOpenAlexFDO

Authors Minghua Chen, Soung C. Liew, Ziyu Shao, Caihong Kai

Publication date 8 June 2017

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

Full work available at URL https://doi.org/10.1109/tit.2013.2268923

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Combinatorial optimization (90C27) Measures of information, entropy (94A17) Applications of design theory to circuits and networks (94C30)

Cited in

(4)

• Utilizing network structure to accelerate Markov chain Monte Carlo algorithms
• Stability and delay of distributed scheduling algorithms for networks of conflicting queues
• Energy-efficient user association in broadcast transmission
• On constrained optimization of the Klimov network and related Markov decision processes

This page was built for publication: Markov Approximation for Combinatorial Network Optimization

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