计算机工程与应用 ›› 2007, Vol. 43 ›› Issue (18): 30-31.

• 学术探讨 • 上一篇    下一篇

若干情形分组和覆盖Steiner问题的算法

王继强1,2   

  1. 1.山东大学 数学与系统科学学院,济南 250100
    2.山东财政学院 数理与统计学院,济南 250014
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2007-06-21 发布日期:2007-06-21
  • 通讯作者: 王继强

Algorithms for some cases of group and covering Steiner problems

WANG Ji-qiang1,2   

  1. 1.School of Mathematics and System Science,Shandong University,Ji’nan 250100,China
    2.School of Mathematics and Statistics,Shandong Finance Institute,Ji’nan 250014,China
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-06-21 Published:2007-06-21
  • Contact: WANG Ji-qiang

摘要:

综合论述了理论计算机科学领域中两个密切相关的NP-困难问题:分组Steiner问题和覆盖Steiner问题的不同解决途径,并就其若干特殊情形设计了近似比更好的近似算法。

Abstract: e review different avenues to solve two closely-related NP-hard problems in theoretical computer science,the group Steiner problem and the covering Steiner problem,and design improved approximation algorithm for some special cases of them.