This survey describes a general approach to a class of problems that arise in combinatorial probability and combinatorial optimization. Formally, the method is part of weak convergence theory, but in concrete problems the method has a flavor of its own. A characteristic element of the method is that it often calls for one to introduce a new, infinite, probabilistic object whose local properties inform us about the limiting properties of a sequence of finite problems.
CITATION STYLE
Aldous, D., & Steele, J. M. (2004). The Objective Method: Probabilistic Combinatorial Optimization and Local Weak Convergence (pp. 1–72). https://doi.org/10.1007/978-3-662-09444-0_1
Mendeley helps you to discover research relevant for your work.