연구동향 분석

설비 최소 지배집합의 빈도수 기반 알고리즘

이상운(Sang-Un Lee) 2014년

논문상세정보
인용/피인용
' 설비 최소 지배집합의 빈도수 기반 알고리즘' 의 주제별 논문영향력
논문영향력 선정 방법
논문영향력 요약
주제
  • 전산공학
  • cardinality
  • frequency
  • greedyalgorithm
  • set cover
동일주제 총논문수 논문피인용 총횟수 주제별 논문영향력의 평균
843 0

0.0%

' 설비 최소 지배집합의 빈도수 기반 알고리즘' 의 참고문헌

  • 최소 차수 정점에 인접한 최대 차수 정점 선택 방법을 적용한 정점 최소 지배집합 알고리즘
    이상운 한국정보기술학회논문지 11 (11) : 37 ~ 44 [2013]
  • 지배집합 알고리즘
    이상운 한국컴퓨터정보학회논문지 18 (9) : 121 ~ 129 [2013]
  • Wikipedia
    Set Cover Problem
  • Two Families of NP-Complete Problems
    M. Pei University of Waterloo [2003]
  • The Stony Brook Algorithm Repository
    S. Skiena Department of Computer Science, Stoney Brook University [2008]
  • Set Covering, Packing and Partitioning Problems
    K. Hoffman Department of Systems Engineering and Operations Research George Mason University [2009]
  • Remarks about Disjoint Dominating Sets
  • Polynomial-time Data Reduction for Dominating Set
    J. Alber Journal of the ACM 51 (3) : 363 ~ 384 [2004]
  • Island Network Analysis: MSTs and Dominating Sets
    A. Desrochers Dept. of Mathematics, Saint Michael's College [2004]
  • Efficient and Effective Practical Algorithms for the Set-Covering Problem
    Q. Yang Department of Computer Science and Software Engineering, University of Wisconsin [2008]
  • Dominating-set-based Routing in Ad Hoc Networks
  • 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]
  • Computers and Intractability: A Guide to the Theory of NPCompleteness
    M. Garey W. H. Freeman & Co [1979]
  • CS 482: Introduction to Analysis of Algorithms
    P. Chew Cornell University [2007]
  • CS 105: Algorithms -Set Cover and Application to Shortest Superstring
    V. K. Wan Computer Science, Darmouth Collage [2005]
  • COMP 572: Introduction to Combinatorial Optimization
    M. Golin Department of Computer Science and Engineering, HKUST [2007]
  • Approximability of Optimization Problems:Set Cover, Minimum Multicut
  • A Tutorial on Integer Programming
    M. A. Trick The Operations Research Faculty of GSIA [1997]
  • A Key-Predistribution- Based Weakly Connected Dominating Set for Secure Clustering in DSN
    A. S. K. Pathan High Performance Computing and Communications, Lecture Notes in Computer Science 4208 : 270 ~ 279 [2006]
  • A Greedy Approximation for Minimum Connected Dominating Sets
    L. Ruan Theoretical Computer Science 329 (1-3) : 325 ~ 330 [2004]