SCOPUS 정보 검색 플랫폼

Volumn 107, Issue 1-3, 2000, Pages 41-59

Approximating a generalization of MAX 2SAT and MIN 2SAT

Author keywords

Approximation algorithm; Minimum cut; Satisfiability

Indexed keywords

EID: 0008860696 PISSN: 0166218X EISSN: None Source Type: Journal
DOI: 10.1016/S0166-218X(00)00244-4 Document Type: Article

Times cited : (8)

References (12)

1
- 0001488083
- On the complexity of timetable and multicommodity flow problems
- Even S., Itai A., Shamir A. On the complexity of timetable and multicommodity flow problems. SIAM J. Comput. 5:1976;691-703.
- (1976) SIAM J. Comput. , vol.5 , pp. 691-703
- Even, S.¹ Itai, A.² Shamir, A.³

2
- 85027123851
- Approximating the value of two prover proof systems, with applications to MAX 2SAT and MAX DICUT
- U. Feige, M. Goemans, Approximating the value of two prover proof systems, with applications to MAX 2SAT and MAX DICUT, Proceedings of the Third Israeli Symposium on the Theory of Computing and Systems, 1995, pp. 182-189.
- (1995) Proceedings of the Third Israeli Symposium on the Theory of Computing and Systems , pp. 182-189
- Feige, U.¹ Goemans, M.²

3
- 0003603813
- San Francisco, CA: Freeman
- Garey M.R., Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness. 1979;Freeman, San Francisco, CA.
- (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness.
- Garey, M.R.¹ Johnson, D.S.²

4
- 0030127682
- Approximate max-flow min-(multi)cut theorems and their applications
- Garg N., Vazirani V.V., Yannakakis M. Approximate max-flow min-(multi)cut theorems and their applications. SIAM J. Comput. 25(2):1996;235-251.
- (1996) SIAM J. Comput. , vol.25 , Issue.2 , pp. 235-251
- Garg, N.¹ Vazirani, V.V.² Yannakakis, M.³

5
- 84893574327
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Goemans M.X., Williamson D.P. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM. 42(6):1995;1115-1145.
- (1995) J. ACM , vol.42 , Issue.6 , pp. 1115-1145
- Goemans, M.X.¹ Williamson, D.P.²

6
- 0030705163
- Forest harvesting and minimum cuts
- Hochbaum D.S., Pathria A. Forest harvesting and minimum cuts. Forest Sci. 43(4):1997;544-554.
- (1997) Forest Sci. , vol.43 , Issue.4 , pp. 544-554
- Hochbaum, D.S.¹ Pathria, A.²

7
- 0347621310
- Manuscript, UC Berkeley, June
- D.S. Hochbaum, A framework for half integrality and good approximations, Manuscript, UC Berkeley, June 1997.
- (1997) A Framework for Half Integrality and Good Approximations
- Hochbaum, D.S.¹

8
- 0000863766
- Spacial optimization for wildlife and timber in managed forest ecosystems
- Hof J.G., Joyce L.A. Spacial optimization for wildlife and timber in managed forest ecosystems. Forest Science. 38(3):1992;489-508.
- (1992) Forest Science , vol.38 , Issue.3 , pp. 489-508
- Hof, J.G.¹ Joyce, L.A.²

9
- 0346991768
- Princeton, NJ: D. Van Nostrand Company
- Klir G.J. Introduction to the Methodology of Switching Circuits. 1972;D. Van Nostrand Company, Princeton, NJ.
- (1972) Introduction to the Methodology of Switching Circuits
- Klir, G.J.¹

10
- 0032620819
- Derandomizing approximation algorithms based on semidefinite programming
- Mahajan S., Ramesh H. Derandomizing approximation algorithms based on semidefinite programming. SIAM J. Comput. 28:1999;1641-1663.
- (1999) SIAM J. Comput. , vol.28 , pp. 1641-1663
- Mahajan, S.¹ Ramesh, H.²

11
- 0004206209
- Englewood Cliffs, NJ: Prentice-Hall
- Morris Mano M. Digital Design. 1984;Prentice-Hall, Englewood Cliffs, NJ.
- (1984) Digital Design
- Morris Mano, M.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.