- Computing Minimum k-Connected m-Fold Dominating Set in General Graphs.INFORMS JOURNAL ON COMPUTING.2018,Vol.30(No.2):217-224
- Breaking the O(ln n) Barrier: An F hanced Approximation Algorithm for Fault-Tolerant Minimum Weight connected Dominating Set.INFORMS JOURNAL ON COMPUTING.2018,Vol.30(No.2):225-235
- Circumference of 3-connected cubic graphs.Journal of Combinatorial Theory, Series B.2018,Vol.128:134-159
- A simple approximation algorithm for minimum weight partial connected set cover.Journal of Combinatorial Optimization.2017,Vol.34(No.3):956-963
- Local ratio method on partial set multi-cover.Journal of Combinatorial Optimization.2017,Vol.34(No.1):302-313
- Approximation algorithm for partial positive influence problem in social network.Journal of Combinatorial Optimization.2017,Vol.33(No.2):791-802
- An approximation algorithm for maximum weight budgeted connected set cover.Journal of Combinatorial Optimization.2016,Vol.31(No.4):1505-1517
- Approximating Maximum Lifetime $k$ -Coverage Through Minimizing Weighted $k$ -Cover in Homogeneous Wireless Sensor Networks.IEEE/ACM Transactions on Networking.2016,Vol.24(No.6):3620-3633
- A proof of an inequality concerning k-restricted edge connectivity.Discrete Mathematics.2005,304(1-3):128-134
[ 张昭 ]
- 教授
- 性别：女
- 电子邮箱：
- 入职时间：2014-07-30
- 在职信息：在岗
- 所在单位：数学科学学院
- 职务：特聘教授
- 学历：博士研究生毕业
- 学位：博士学位
- 学科：数学与应用数学 计算机科学与技术
- 毕业院校：新疆大学
联系方式
- 邮编：
- 邮箱：
