연구동향 분석

집합피복 문제의 개선된 탐욕 알고리즘

이상운(Sang-Un Lee) 2015년

논문상세정보
인용/피인용
' 집합피복 문제의 개선된 탐욕 알고리즘' 의 주제별 논문영향력
논문영향력 선정 방법
논문영향력 요약
주제
  • 전산공학
  • cardinality
  • greedyalgorithm
  • np-complete
  • proper set
  • set cover
동일주제 총논문수 논문피인용 총횟수 주제별 논문영향력의 평균
588 0

0.0%

' 집합피복 문제의 개선된 탐욕 알고리즘' 의 참고문헌

  • 지배집합 알고리즘
    이상운 한국컴퓨터정보학회논문지 18 (9) : 121 ~ 129 [2013]
  • The Stony Brook Algorithm Repository
    S. Skiena Stoney Brook University [2008]
  • Solving the Set Cover Problem and the Problem of Exact Cover by 3-sets in the Adleman-Lipton Model
    W. L. Chang Bio Systems 72 (3) : 263 ~ 275 [2003]
  • Set Covering, Packing and Partitioning Problem
    K. Hoffman George Mason University [2009]
  • Set Cover Problem
  • Local Improvement and Weighted Set Packing Approximation
    B. Chandra Journal of Algorithms 39 (2) : 223 ~ 240 [2001]
  • Efficient and Effective Practical Algorithms for the Set-Covering Problem
    Q. Yang [2008]
  • Connected Set Cover Problem and Its Applications
    T. P. Shuai Algorithmic Aspects in Information and Management, Lecture Notes in Computer Science 4041 : 243 ~ 254 [2006]
  • Computer Science
    V. K. Wan Darmouth Collage [2005]
  • CS 482: Introduction to Analysis of Algorithms
    P. Chew Cornell University [2007]
  • COMP 572: Introduction to Combinatorial Optimization
    M. Golin HKUST [2007]
  • Approximability of Optimization Problems:Set Cover, Minimum Multicut
  • An Introduction to Approximation Algorithms
  • A Tutorial on Integer Programming
    M. A. Trick [1997]
  • 4-색 알고리즘
    이상운 한국컴퓨터정보학회논문지 18 (5) : 113 ~ 120 [2013]