Parallel approximation algorithms by positive linear programming

Algorithmica (New York)

Volumn 21, Issue 1, 1998, Pages 72-88

  Trevisan, L ^a  

^a UNIVERSITY OF GENEVA   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001995941     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009209     Document Type: Article

References (38)

1. S. Arora, D. Karger, and M. Karpinski. Polynomial time approximation schemes for dense instances of graph problems. In Proceedings of the 27th ACM Symposium on Theory of Computing, pages 284-293, 1995.
2. T. Asano, T. Ono, and T. Hirata. Approximation algorithms for the maximum satisfiability problem. In Proceedings of the 5th Scandinavian Workshop on Algorithm Theory, pages 100-111. LNCS 1097. Springer-Verlag, Berlin, 1996.
3. N. Alon and J. Spencer. The Probabilistic Method. Wiley Interscience, New York, 1992.
4. M. Bellare. Proof checking and approximation: towards tight results. Sigact News, 27(1), 1996.
5. D.P. Bovet and P. Crescenzi. Introduction to the Theory of Complexity. Prentice-Hall, Englewood Cliffs, NJ, 1993.
6. G. Bongiovanni, P. Crescenzi, and S. De Agostino. Descriptive complexity and parallel approximation of optimization problems. Manuscript, 1991.
7. M. Bellare, O. Goldreich, and M. Sudan. Free bits, PCP's and non-approximability - towards tight results (3rd version). Technical Report TR95-24, Electronic Colloquium on Computational Complexity, 1995.
8. Preliminary version in Proc. FOCS '95.
9. B. Chor and M. Sudan. A geometric approach to betweennes. In Proceedings of the 3rd European Symposium on Algorithms, pages 227-237. LNCS 979. Springer-Verlag, Berlin, 1995.
10. J. Díaz, M. Serna, P. Spirakis, and J. Torán. Paradigms for Fast Parallel Approximability. Cambridge University Press, Cambridge, 1997.
11. U. Feige and M. Goemans. Approximating the value of two provers proof systems, with applications to MAX 2SAT and MAX DICUT. In Proceedings of the 3rd IEEE Israel Symposium on Theory of Computing and Systems, pages 182-189, 1995.
12. M. Goemans and D. Williamson. New 3/4-approximation algorithms for the maximum satisfiability problem. SIAM Journal on Discrete Mathematics, 7(4):656-666, 1994.
13. Preliminary version in Proc. IPCO '93.
14. M.X. Goemans and D. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the Association for Computing Machinery, 42(6):1115-1145, 1995.
15. Preliminary version in Proc. STOC '94.
16. D.J. Haglin. Approximating maximum 2-CNF satisfiability. Parallel Processing Letters, 2:181-187, 1992.
17. H.B. Hunt III, M.V. Marathe, V. Radhakrishnan, S.S. Ravi, D.J. Rosenkrantz, and R.E. Stearns. Every problem in MAX SNP has a parallel approximation algorithm. Manuscript, 1993.
18. D. Hochbaum. Approximation algorithms for set covering and vertex cover problems. SIAM Journal on Computing, 11:555-556, 1982.
19. N. Karmakar. A new polynomial-time algorithm for linear programming. Combinatorica, 4:373-395, 1984.
20. L.G. Khachian. A polynomial time algorithm for linear programming. Doklady Akademia Nauk SSR, 224:1093-1096, 1979.
21. D. Karger, R. Motwani, and M. Sudan. Approximate graph coloring by semidefinite programming. In Proceedings of the 35th IEEE Symposium on Foundations of Computer Science, pages 2-13, 1994.
22. S. Khanna, R. Motwani, M. Sudan, and U. Vazirani. On syntactic versus computational views of approximability. In Proceedings of the 35th IEEE Symposium on Foundations of Computer Science, pages 819-830, 1994.
23. M. Luby. A simple parallel algorithm for the maximal independent set problem. SIAM Journal on Computing, 15:1036-1053, 1986.
24. M. Luby and N. Nisan. A parallel approximation algorithm for positive linear programming. In Proceedings of the 25th ACM Symposium on Theory of Computing, pages 448-457, 1993.
25. M. Luby and A. Wigderson. Pairwise independence and derandomization. Technical Report TR-95-035, International Computer Science Institute, 1995.
26. H.C. Lau and O. Watanabe. Randomized approximation of the constraint satisfaction problem. In Proceedings of the 5th Scandinavian Workshop on Algorithm Theory, pages 76-87. LNCS 1097. Springer-Verlag, Berlin, 1996.
27. N. Megiddo. A note on approximate linear programming. Information Processing Letters, 42(1):53, 1992.
28. C.H. Papadimitriou. Computational Complexity. Addison-Wesley, Reading, MA, 1994.
29. C.H. Papadimitriou and M. Yannakakis. Optimization, approximation, and complexity classes. Journal of Computer and System Sciences, 43:425-440, 1991.
30. Preliminary version in Proc. STOC '88.
31. P. Raghavan. Probabilistic construction of deterministic algorithms: approximating packing integer programs. Journal of Computer and System Sciences, 37:130-143, 1988.
32. P. Raghavan, and C.D. Thompson. Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Combinatorica, 7:365-374, 1987.
33. M. Serna. Approximating linear programming is log-space complete for P. Information Processing Letters, 37(4):233-236, 1991.
34. D. Shmoys. Computing near-optimal solutions to combinatorial optimization problems. In Combinatorial Optimization. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 20. American Mathematical Society, Providence, RI, 1995.
35. M. Serna and F. Xhafa. On parallel versus sequential approximation. In Proceedings of the 3rd European Symposium on Algorithms, pages 409-419, 1995.
36. L. Trevisan, G.B. Sorkin, M. Sudan, and D.P. Williamson. Gadgets, approximation, and linear programming. In Proceedings of the 37th IEEE Symposium on Foundations of Computer Science, pages 617-626, 1996.
37. M. Yannakakis. On the approximation of maximum satisfiability. Journal of Algorithms, 17:475-502, 1994.
38. Preliminary version in Proc. SODA '92.