Markov Approximation for Combinatorial Network Optimization

@article{Chen2010MarkovAF,
  title={Markov Approximation for Combinatorial Network Optimization},
  author={Minghua Chen and Soung Chang Liew and Ziyu Shao and Caihong Kai},
  journal={2010 Proceedings IEEE INFOCOM},
  year={2010},
  pages={1-9}
}
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… CONTINUE READING
Highly Influential
This paper has highly influenced 25 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 155 citations. REVIEW CITATIONS
94 Citations
29 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 94 extracted citations

155 Citations

0102030'10'12'14'16'18
Citations per Year
Semantic Scholar estimates that this publication has 155 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 29 references

Markov Processes for Stochastic Modeling

  • M. Kijima
  • Boca Raton, FL: CRC Press,
  • 1997
Highly Influential
6 Excerpts

Similar Papers

Loading similar papers…