PTAS for maximum weight independent set problem with random weights in bounded degree graphs

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2010, Pages 268-278

  Gamarnik, David ^a   Goldberg, David ^a   Weber, Theophane ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; GRAPHIC METHODS; POLYNOMIAL APPROXIMATION;

BOUNDED DEGREE GRAPHS; COMBINATORIAL OPTIMIZATION PROBLEMS; DETERMINISTIC APPROXIMATION; EXPONENTIAL DISTRIBUTIONS; MAXIMUM WEIGHT INDEPENDENT SET PROBLEMS; POLYNOMIAL TIME APPROXIMATION ALGORITHMS; POLYNOMIAL TIME APPROXIMATION SCHEMES; WEIGHT INDEPENDENT SETS;

APPROXIMATION ALGORITHMS;

EID: 77951682942     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973075.23     Document Type: Conference Paper

References (19)

1. [Ald92] D. Aldous, Asymptotics in the random assignment problem, Probability Theory and Related Fields 93 (1992), no. 4, 507-534.
2. [Ald01] -, The ζ(2) limit in the random assignment problem, Random Structures and Algorithms 18 (2001), 381-418.
3. [AS03] D. Aldous and J. M. Steele, The objective method: Probabilistic combinatorial optimization and local weak convergence, Discrete Combinatorial Probability, H. Kesten Ed., Springer-Verlag, 2003.
4. +07] M. Bayati, D. Gamarnik, D. Katz, C. Nair, and P. Tetali, Simple deterministic approximation algorithms for counting matchings, Proc. of the 39th annual ACM Symposium on Theory of computing, 2007, pp. 122-127.
5. [BK98] P. Berman and M. Karpinski, On some tighter inapproximability results, Tech. report, Electronic Colloquium on Computational Complexity, 1998.
6. [GDT] D. Goldberg, D.Gamarnik, and T.Weber, Correlation decay in random decision networks: Sufficient conditions for efficient decentralized optimization, In preparation.
7. [GG09] D. Gamarnik and D.A. Goldberg, Randomized greedy algorithms for independent sets and matchings in regular graphs: Exact results and finite girth corrections, Combinatorics, Probability and Computing (2009), 1-25.
8. [GK07a] D. Gamarnik and D. Katz, A Deterministic Approximation Algorithm for Computing a Permanent of a 0, 1 matrix, Arxiv preprint math.CO/0702039 (2007).
9. [GK07b] -, Correlation decay and deterministic FP-TAS for counting list-colorings of a graph, Proc. of the 18th annual ACM-SIAM Symposium On Discrete Algorithms, 2007, pp. 1245-1254.
10. [GNS06] D. Gamarnik, T. Nowicki, and G. Swirscsz, Maximum weight independent sets and matchings in sparse random graphs. Exact results using the local weak convergence method, Random Structures and Algorithms 28 (2006), no. 1, 76-106.
11. [Has96] J. Hastad, Clique is hard to approximate within n, Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996, pp. 627-636.
12. [JLR00] S. Janson, T. Luczak, and A. Ruciński, Random graphs, John Wiley New York, 2000.
13. [JS07] K. Jung and D. Shah, Inference in Binary Pair-wise Markov Random Fields through Self-Avoiding Walks, Proceedings of Allerton Conference on Computation, Communication and Control, 2007, p. 8.
14. [KS81] R. Karp and M. Sipser, Maximum matching in sparse random graphs, Proceedings of the 22nd Annual Symposium on the Foundations of Computer Science, 1981, pp. 364-375.
15. [LV97] M. Luby and E. Vigoda, Approximately counting up to four, Proceedings of the 29d Annual ACM Symposium on the Theory of Computing (1997), 682-687.
16. [MP03] M. Mezard and G. Parisi, The cavity method at zero temperature, Journal of Statistical Physics 111 (2003), no.1-2, 1-34.
17. [RBMM04] O. Rivoire, G. Biroli, O. C. Martin, and M. Mezard, Glass models on Bethe lattices, Eur. Phys. J. B 37 (2004), 55-78.
18. [Tre01] L. Trevisan, Non-approximability results for optimization problems on bounded degree instances, ACM Symposium on Theory of Computing, 2001.
19. [Wei06] D. Weitz, Counting independent sets up to the tree threshold, Proc. 38th Ann. Symposium on the Theory of Computing, 2006.