Approximation algorithms

Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques

Volumn , Issue , 2005, Pages 557-585

  Gomes, Carla P ^a   Williams, Ryan ^b  

^a School of Operations Research and Information Engineering   (United States)

^b Carnegie Mellon University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84892131595     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/0-387-28356-0_18     Document Type: Chapter

References (43)

1. Agrawal, M., Kayal, N. and Saxena, N., 2002, Primes in P, www.cse.iitk.ac.in/news/primality.html
2. Aho, A. V., Hopcroft, J. E. and Ullman, J. D., 1979, Computers and intractability: A guide to NF'-Completeness, Freeman, San Francisco.
3. Aho, A. V., Hopcroft, J. E. and Ullman, J. D., 1983, Data structures and Algorithms, Computer Science and Information Processing Series, Addison-Wesley, Reading, MA
4. Alon, N. and Spencer, J., 2000, The Probabilistic Method, Wiley, New York
5. Arora, S., 1998, Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems, J. ACM 45:753-782.
6. Arora, S., Lund, C, Motwani, R., Sudan, M. and Szegedy, M., 1998, Proof verification and the hardness of approximation problems, J. ACM 45:501-555.
7. Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A. and Protasi, M., 1999, Complexity and Approximation, Springer, Berlin.
8. Beier, R. and Vocking, B., 2003, Random knapsack in expected polynomial time, Proc. ACM Symp. on Theory of Computing, pp. 232-241.
9. Chazelle, B., 2001, The Discrepancy Method, Cambridge University Press, Cambridge.
10. Chvatal, V., 1979, A greedy heuristic for the set-covering, Math. Open Res. 4:233-235.
11. Chvatal, V., 1983, Linear Programming, Freeman, San Francisco.
12. Clay Mathematics Institute, 2003, The millenium prize problems: P vs. NP, http://www.claymath.org
13. Colbourn, C, 1984, The complexity of completing partial Latin squares, Discrete Appl. Math. 8:25-30.
14. Cook, W., Cunningham, W., Pulleyblank, W. and Schrijver, A., 1988, Combinatorial Optimization, Wiley, New York.
15. Cormen, T. H., Leiserson, C. E., Rivest, R. L. and Stein, C, 2001, Introduction to Algorithms, MIT Press, Cambridge, MA.
16. Dantzig, G., 1998, Linear Programming and Extensions, Princeton University Press, Princeton, NJ.
17. Feige, U., 2002, Relations between average case complexity and approximation complexity, in: Proc. ACM Symp. on Theory of Computing, pp. 534-543.
18. Feller, W., 1971, An Introduction to Probability Theory and Its Applications, Wiley, New York.
19. Garey, M. R., Graham, R. L. and Ulman, J. D., 1972, Worst case analysis of memory allocation algorithms, in: Proc. ACM Symp. on Theory of Computing, pp. 143-150.
20. Goemans, M. X. and Williamson, D. P., 1995, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming, J. ACM 42:1115-1145.
21. Goldwasser, S. and Kilian, J., 1986, Almost all primes can be quickly certified, in: Proc. Annual IEEE Symp. on Foundations of Computer Science, pp. 316-329.
22. Gomes, C, Selman, B., Crato, N. and Kautz, H., 2000, Heavy-tailed phenomena in satisfiability and constraint satisfaction problems, J. Autom. Reason. 24:67-100.
23. Gomes, C. P., Selman, B. and Kautz, H., 1998, Boosting combinatorial search through randomization, in: Proc. 15th National Conf. on Artificial Intelligence (AAAI-98), AAAI Press, Menlo Park, CA.
24. Gomes, C. P. and Shmoys, D., 2002, The promise of LP to boost CSP techniques for combinatorial problems, in: Proc. 4th Int. Workshop on Integration of Aland OR Techniques in Constraint Programming for Combinatorial Optimisation Problems (CP-AI-OR'02), Le Croisic, France, N. Jussien and F. Laburthe, eds, pp. 291-305.
25. Graham, R. L., 1966, Bounds for certain multiprocessing anomalies, Bell Syst. Tech. 7. 45:1563-1581.
26. Gurevich, Y., 1991, Average Case Complexity, in: Proc. 18th Int. Colloquium on Automata, Languages, and Programming (ICALP'91), Lecture Notes in Computer Science, Vol. 510, pp. 615-628, Springer, Berlin.
27. Hochbaum, D. S., 1997, ed., Approximation Algorithms for NP-Hard Problems, PWS Publishing Company, Boston, MA.
28. Johnson, D. S., 1974, Approximation algorithms for combinatorial problems, J. Comput. Syst. Sci. 9:256-278.
29. Khot, S. and Regev, O., 2003, Vertex cover might be hard to approximate within 2-e, in: Proc. IEEE Conf. on Computational Complexity.
30. Kirkpatrick, S., Gelatt, C. and Vecchi, M., 1983, Optimization by simulated annealing, Science 220:671-680.
31. Kozen, D., 1992, The design and analysis of algorithms, Springer, New York.
32. Kumar, S. R., Russell, A. and Sundaram, R., 1999, Approximating Latin square extensions, Algorithmica 24:128-138.
33. Laywine, C. and Mullen, G., 1998, Discrete Mathematics using Latin Squares, Discrete Mathematics and Optimization Series, Wiley-Interscience, New York.
34. Motwani, R. and Raghavan, P., 1995, Randomized Algorithm, Cambridge University Press, Cambridge.
35. Nemhauser, G. and Wolsey, L., 1988, Integer and Combinatorial Optimization, Wiley, New York.
36. Papadimitriou, C. and Steiglitz, K., 1982, Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, Englewood Cliffs, NJ.
37. Rabin, M. (1980). Probabilistic algorithm for testing primality, J. Number Theory 12:128-138.
38. Schrijver, A., 2003, Combinatorial Optimization Polyhedra and Efficiency, Springer, Berlin.
39. Shmoys, D., 1995, Computing near-optimal solutions to combinatorial optimization problems, in: Combinatorial Optimization, Discrete Mathematics and Theoretical Computer Science Series, W. Cook, L. Lovasz and P. Seymour, eds, American Mathematical Society, Providence, RI.
40. Solovay, R. and Strassen, V., 1977, A fast Monte Carlo test for primality, SIAM J. Comput. 6:84-86.
41. Srinivasan, A., Approximation algorithms via randomized rounding: a survey. Available from: citeseer.nj.nec.com/493290.html
42. Vazirani, V., 1983, Approximation Algorithms, Springer, Berlin.
43. Williams, R., Gomes, C. P. and Selman, B., 2003, Backdoors to typical case complexity, In Proc. Int. Joint Conf. on Artificial Intelligence (IJCAI).