The DOI matches its Crossref record.
Markov Approximation for Combinatorial Network Optimization
Abstract
Many important network design problems are fundamentally combinatorial optimization problems. A large number of such problems, however, cannot readily be tackled by distributed algorithms. The Markov approximation framework studied in this paper is a general technique for synthesizing distributed algorithms. We show that when using the log-sum-exp function to approximate the optimal value of any combinatorial problem, we end up with a solution that can be interpreted as the stationary probability distribution of a class of time-reversible Markov chains. Selected Markov chains among this class yield distributed algorithms that solve the log-sum-exp approximated combinatorial network optimization problem. By examining three applications, we illustrate that the Markov approximation technique not only provides fresh perspectives to existing distributed solutions, but also provides clues leading to the construction of new distributed algorithms in various domains with provable performance. We believe the Markov approximation techniques will find applications in many other network optimization problems.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
A comprehensive survey of Network Function Virtualization
Yi, B., Wang, X., Li, K., Das, S. K., & Huang, M. (2018) · Computer Networks · doi:10.1016/j.comnet.2018.01.021 · Cited by 534
Zhao, N., Liang, Y.-C., Niyato, D., Pei, Y., Wu, M., & Jiang, Y. (2019) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2019.2933417 · Cited by 461
Joint Task Offloading and Resource Allocation for Energy-Constrained Mobile Edge Computing
Jiang, H., Dai, X., Xiao, Z., & Iyengar, A. (2023) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2022.3150432 · Cited by 411
UAV-Assisted Task Offloading in Vehicular Edge Computing Networks
Dai, X., Xiao, Z., Jiang, H., & Lui, J. C. S. (2024) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2023.3259394 · Cited by 284
When UAV Swarm Meets Edge-Cloud Computing: The QoS Perspective
Chen, W., Liu, B., Huang, H., Guo, S., & Zheng, Z. (2019) · IEEE Network · doi:10.1109/mnet.2019.1800222 · Cited by 184
Metadata
- Authors
- Chen, M., Liew, S. C., Shao, Z., & Kai, C.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2013-10
- Volume
- 59
- Issue
- 10
- Pages
- 6301-6327
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2089050596
- Cited by
- 197
- References
- 0
- FWCI
- 16.74
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Markov Approximation for Combinatorial Network Optimization. https://app.cochat.ai/papers/10.1109/tit.2013.2268923
- The paper
- Chen, M., Liew, S. C., Shao, Z., & Kai, C. (2013). Markov Approximation for Combinatorial Network Optimization. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.2013.2268923
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.