Approximation algorithms

Proceedings of the National Academy of Sciences of the United States of America

Volumn 94, Issue 24, 1997, Pages 12734-12735

  Schulz, Andreas S ^a   Shmoys, David B ^b   Williamson, David P ^c  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^b Cornell University   (United States)

^c IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; COMPUTER; CONFERENCE PAPER; GERMANY; INFORMATION PROCESSING; PRIORITY JOURNAL; UNITED STATES;

EID: 0030725495     PISSN: 00278424     EISSN: None     Source Type: Journal    
DOI: 10.1073/pnas.94.24.12734     Document Type: Article

References (11)

1. Arora, S. & Lund, C. (1997) in Approximation Algorithms for NP-Hard Problems, ed. Hochbaum, D. S. (PWS, Boston), pp. 399-446.
2. Barahona, F., Grötschel, M., Jünger, M. & Reinelt, G. (1988) Oper. Res. 36, 493-513.
3. Motwani, R. & Raghavan, P. (1995) Randomized Algorithms (Cambridge Univ. Press, New York).
4. Alon, N. & Spencer, J. H. (1992) The Probabilistic Method (Wiley, New York).
5. Goemans, M. X. & Williamson, D. P. (1995) J. Assoc. Comput. Mach. 42, 1115-1145.
6. Goemans, M. X. (1997) Math. Prog. 79, 143-161.
7. Raghavan, P. & Thompson, C. D. (1987) Combinatorica 7, 365-374.
8. Arora, S. (1996) Proceedings of the 37th Annual Symposium on Foundations of Computer Science (IEEE Computer Society Press, Los Alamitos, CA), pp. 2-13.
9. Mitchell, J. S. B. (1997) SIAM J. Comput., in press.
10. Shmoys, D. B. (1995) in Combinatorial Optimization, eds. Cook, W., Lovász, L. & Seymour, P. D. (American Mathematical Society, Providence, RI), pp. 355-397.
11. Hochbaum, D. S., ed. (1997) Approximation Algorithms for NP-Hard Problems (PWS, Boston).