메뉴 건너뛰기
Mathematical Programming, Series B
Volumn 90, Issue 1, 2001, Pages 101-111
A .699-approximation algorithm for Max-Bisection
Author keywords

Graph bisection; Polynomial time approximation algorithm; Semidefinite programming
Indexed keywords

EID: 0000734821     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00011415     Document Type: Article
Times cited : (84)
References (5)
  • 1
    • 0005325563 scopus 로고    scopus 로고
    • Semidefinite relaxations, multivariate normal distributions, and order statistics
    • Du, D.-Z., Pardalos, P.M., eds., Kluwer Academic Publishers
    • Bertsimas, D., Ye, Y. (1998): Semidefinite relaxations, multivariate normal distributions, and order statistics. In: Du, D.-Z., Pardalos, P.M., eds., Handbook of Combinatorial Optimization (Vol. 3), pp. 1-19. Kluwer Academic Publishers
    • (1998) Handbook of Combinatorial Optimization , vol.3 , pp. 1-19
    • Bertsimas, D.1    Ye, Y.2
  • 2
    • 84948979382 scopus 로고
    • Improved approximation algorithms for max k-cut and max bisection
    • Frieze, A., Jerrum, M. (1995): Improved approximation algorithms for max k-cut and max bisection. Proc. 4th IPCO Conference, pp. 1-13
    • (1995) Proc. 4th IPCO Conference , pp. 1-13
    • Frieze, A.1    Jerrum, M.2
  • 3
    • 84893574327 scopus 로고
    • Improved approximation algorithms for Maximum Cut and Satisfiability problems using semidefinite programming
    • Goemans, M.X., Williamson, D.P. (1995): Improved approximation algorithms for Maximum Cut and Satisfiability problems using semidefinite programming. J. ACM 42, 1115-1145
    • (1995) J. ACM , vol.42 , pp. 1115-1145
    • Goemans, M.X.1    Williamson, D.P.2
  • 4
    • 0031681870 scopus 로고    scopus 로고
    • Semidefinite relaxation and nonconvex quadratic optimization
    • Nesterov, Y.E. (1998): Semidefinite relaxation and nonconvex quadratic optimization. Optim. Methods Software 9, 141-160
    • (1998) Optim. Methods Software , vol.9 , pp. 141-160
    • Nesterov, Y.E.1
  • 5
    • 0032631766 scopus 로고    scopus 로고
    • Outward rotations: A tool for rounding solutions of semidefinite programming relaxations, with applications to Max Cut and other problems
    • Zwick, U. (1999): Outward rotations: a tool for rounding solutions of semidefinite programming relaxations, with applications to Max Cut and other problems. In: Proceedings of the 10th ACM Symposium on Discrete Algorithms
    • (1999) Proceedings of the 10th ACM Symposium on Discrete Algorithms
    • Zwick, U.1

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