메뉴 건너뛰기




Volumn , Issue , 2002, Pages 238-247

Correlation clustering

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; GRAPH THEORY; PROBABILITY; RANDOM PROCESSES; SET THEORY; THEOREM PROVING;

EID: 0036949730     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (198)

References (20)
  • 3
    • 0030409562 scopus 로고    scopus 로고
    • A new rounding procedure for the assignment problem with applications to dense graph arrangements
    • S. Arora, A. Frieze, and H. Kaplan. A new rounding procedure for the assignment problem with applications to dense graph arrangements. In Proc. IEEE FOCS, pages 21-30, 1996.
    • (1996) Proc. IEEE FOCS , pp. 21-30
    • Arora, S.1    Frieze, A.2    Kaplan, H.3
  • 5
    • 0345656700 scopus 로고    scopus 로고
    • Correlation clustering
    • Manuscript
    • N. Bansal, A. Blum, and S. Chawla. Correlation clustering (http://www.cs.cmu.edu/!schuchi/papers/clusteringfull.ps). Manuscript, 2002.
    • (2002)
    • Bansal, N.1    Blum, A.2    Chawla, S.3
  • 8
    • 0012526899 scopus 로고    scopus 로고
    • Personal communication
    • W. Cohen and A. McCallum. Personal communication, 2001.
    • (2001)
    • Cohen, W.1    McCallum, A.2
  • 11
    • 0035580899 scopus 로고    scopus 로고
    • Algorithms for graph partitioning on the planted partition model
    • A. Condon and R. Karp. Algorithms for graph partitioning on the planted partition model. Random Structures and Algorithms, 18(2):116-140, 1999.
    • (1999) Random Structures and Algorithms , vol.18 , Issue.2 , pp. 116-140
    • Condon, A.1    Karp, R.2
  • 12
    • 0030136319 scopus 로고    scopus 로고
    • Max-cut has a randomized approximation scheme in dense graphs
    • F. de la Vega. Max-cut has a randomized approximation scheme in dense graphs. Random Structures and Algorithms, 8(3):187-198, 1996.
    • (1996) Random Structures and Algorithms , vol.8 , Issue.3 , pp. 187-198
    • De La Vega, F.1
  • 13
    • 0032108275 scopus 로고    scopus 로고
    • Property testing and its connection to learning and approximation
    • O. Goldreich, S. Goldwasser, and D. Ron. Property testing and its connection to learning and approximation. JACM, 45(4):653-750, 1998.
    • (1998) JACM , vol.45 , Issue.4 , pp. 653-750
    • Goldreich, O.1    Goldwasser, S.2    Ron, D.3
  • 14
    • 0022753024 scopus 로고
    • A unified approach to approximation algorithms for bottleneck problems
    • D. Hochbaum and D. Shmoys. A unified approach to approximation algorithms for bottleneck problems. JACM, 33:533-550, 1986.
    • (1986) JACM , vol.33 , pp. 533-550
    • Hochbaum, D.1    Shmoys, D.2
  • 15
    • 0000217848 scopus 로고    scopus 로고
    • Primal-dual approximation algorithms for metric facility location and k-median problem
    • K. Jain and V. Vazirani. Primal-dual approximation algorithms for metric facility location and k-median problem. In Proc. 40th IEEE FOCS, 1999.
    • Proc. 40th IEEE FOCS, 1999
    • Jain, K.1    Vazirani, V.2
  • 18
    • 0035186726 scopus 로고    scopus 로고
    • Spectral partitioning of random graphs
    • F. McSherry. Spectral partitioning of random graphs. In FOCS, pages 529-537, 2001.
    • (2001) FOCS , pp. 529-537
    • McSherry, F.1
  • 19
    • 35048818808 scopus 로고    scopus 로고
    • Testing the diameter of graphs
    • M. Parnas and D. Ron. Testing the diameter of graphs. In Proceedings of RANDOM, pages 85-96, 1999.
    • (1999) Proceedings of RANDOM , pp. 85-96
    • Parnas, M.1    Ron, D.2
  • 20
    • 0033723962 scopus 로고    scopus 로고
    • Clustering for edge-cost minimization
    • L. Schulman. Clustering for edge-cost minimization. In ACM STOC, pages 547-555, 2000.
    • (2000) ACM STOC , pp. 547-555
    • Schulman, L.1


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