SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Journal of Computer and System Sciences

Volumn 63, Issue 4, 2001, Pages 639-671

Heuristics for semirandom graph problems

(2) Feige, Uriel a Kilian, Joe b

a WEIZMANN INSTITUTE OF SCIENCE (Israel)

b NEC LABORATORIES AMERICA (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EQUIVALENCE CLASSES; HEURISTIC METHODS; MATHEMATICAL MODELS; PROBABILITY; PROBLEM SOLVING; RANDOM PROCESSES; SET THEORY; THEOREM PROVING;

RANDOM HYPERPLANES; SEMIRANDOM GRAPH MODELS;

GRAPH THEORY;

EID: 0035734153 PISSN: 00220000 EISSN: None Source Type: Journal
DOI: 10.1006/jcss.2001.1773 Document Type: Article

Times cited : (176)

References (25)

1
- 0003169116
- Interior point methods in semidefinite programming with applications to combinatorial optimization
- (1995) SIAM J. Optimization , vol.5 , pp. 13-51
- Alizadeh, F.¹

2
- 0001690318
- A spectral technique for coloring random 3-colorable graphs
- (1997) SIAM J. Comput. , vol.26 , pp. 1733-1748
- Alon, N.¹ Kahale, N.²

3
- 0001262835
- Approximating the independence number via the 9-function
- (1998) Math. Programming , vol.80 , pp. 253-264
- Alon, N.¹ Kahale, N.²

4
- 0032221884
- Finding a large hidden clique in a random graph
- (1998) Random Structures and Algorithms , vol.13 , pp. 457-466
- Alon, N.¹ Krivelevich, M.² Sudakov, B.³

5
- 0003430191
- The probabilistic method
- Wiley
- (1992)
- Alon, N.¹ Spencer, J.² Erdos, P.³

6
- 0001215301
- Coloring random and semirandom k-colorable graphs
- (1995) J. Algorithms , vol.19 , pp. 204-234
- Blum, A.¹ Spencer, J.²

7
- 0030737372
- 3/14)-coloring algorithm for 3-colorable graphs
- (1997) Inform. Process. Lett. , vol.61 , pp. 49-53
- Blum, A.¹ Karger, D.²

8
- 0023601196
- Eigenvalues and graph bisection: An average-case analysis
- IEEE Computer Society Press, Los Angeles, CA
- (1987) Proceedings of the 28th Annual Symposium on Foundations of Computer Science , pp. 280-285
- Boppana, R.¹

9
- 0001159084
- Approximating maximum independent sets by excluding subgraphs
- (1992) BIT , vol.32 , pp. 180-196
- Boppana, R.¹ Halldorsson, M.²

10
- 0011620023
- Cliques, coloring, and satisfiability: Second DIMACS implementation challenge
- D. S. Johnson and M. A. Trick (Eds); Amer. Math. Soc.
- (1993) DIMACS Series in Discrete Mathematics and Theoretical Computer Science , vol.26

11
- 0015661138
- Lower bounds for the partitioning of graphs
- (1973) IBM J. Res. Develop. , vol.17 , pp. 420-425
- Donath, W.¹ Hoffman, A.²

12
- 0031474843
- Randomized graph products, chromatic numbers, and the lovasz 9-function
- (1997) Combinatorica , vol.17 , pp. 79-90
- Feige, U.¹

13
- 0032178928
- Zero knowledge and the chromatic number
- (1998) J. Comput. System Sci. , vol.57 , pp. 187-199
- Feige, U.¹ Kilian, J.²

14
- 0034406149
- Finding and certifying a large hidden clique in a semirandom graph
- (2000) RSA: Random Structures & Algorithms , vol.16 , pp. 195-208
- Feige, U.¹ Krauthgamer, R.²

15
- 0034512731
- A polylogarithmic approximation of the minimum bisection
- IEEE Computer Society Press, 1109 Spring Street, Suite 300, Silver Spring, MD 20910, USA
- (2000) 41st Annual Symposium on Foundations of Computer Science: Proceedings: 12-14 November, 2000, Redondo Beach, California , pp. 105-115
- Feige, U.¹ Krauthgamer, R.²

16
- 0033723963
- Approximating the minimum bisection size (extended abstract)
- ACM Press, New York, NY, USA
- (2000) Proceedings of the Thirty Second Annual ACM Symposium on Theory of Computing: Portland, Oregon, May 21-23, [2000] , pp. 530-536
- Feige, U.¹ Krauthgamer, R.² Nissim, K.³

17
- 0031538868
- Algorithmic theory of random graphs
- (1997) Random Structures Algorithms , vol.10 , pp. 5-42
- Frieze, A.¹ McDiarmid, C.²

18
- 51249182622
- The eigenvalues of random symmetric matrices
- (1981) Combinatorica , vol.1 , pp. 233-241
- Furedi, Z.¹ Komlos, J.²

19
- 84893574327
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- (1995) J. Assoc. Comput. Mach. , vol.42 , pp. 1115-1145
- Goemans, M.X.¹ Williamson, D.P.²

20
- 0027201216
- A still better performance guarantee for approximate graph coloring
- (1993) Inform. Process. Lett. , vol.45 , pp. 19-23
- Halldórsson, M.¹

21
- 0030386107
- 1-ε
- (1996) Proc. 37th Annual Symp. on Foundations of Computer Science , pp. 627-636
- Håstad, J.¹

22
- 0032028848
- Approximate graph coloring by semidefinite programming
- (1998) J. Assoc. Comput. Mach. , vol.45 , pp. 246-265
- Karger, D.¹ Motwani, R.² Sudan, M.³

23
- 0018292109
- On the shannon capacity of a graph
- (1979) IEEE Trans. Inform. Theory , vol.25 , pp. 1-7
- Lovász¹

24
- 0001469422
- Nonpolyhedral relaxations of graph-bisection problems
- (1995) SIAM J. Optim. , vol.5 , pp. 467-487
- Poljak, S.¹ Rendl, F.²

25
- 0029542998
- Minimum coloring random and semirandom graphs in polynomial expected time
- (1995) Proc. 36th Annual Symposium on Foundations of Computer Science , pp. 463-472
- Subramanian, C.¹

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