张昭 - 浙江师范大学 - 数学与计算机科学学院

个人简介

2003年获新疆大学理学博士学位。浙江省“钱江学者”特聘教授、浙江省“151人才”第一层次人选。 2012年获国家自然科学优秀青年基金、2008年入选教育部新世纪优秀人才支持计划、2008年获霍英东高等院校青年教师奖、2011年获新疆科技进步一等奖、2013年获新疆青年科技奖。主持完成3项国家自然科学基金项目和4项教育部科研项目；现主持1项国家自然科学基金面上项目，参与1项国家自然科学基金重点项目和1项国家自然科学基金应急管理项目。发表学术论文140余篇，被SCI索引90余篇。已培养博士3名、硕士27名；现指导2名博士生、6名硕士。研究生招生学科方向运筹学、理论计算机科学。教育经历 2000-9~2003-6 新疆大学 | 应用数学 | 博士 1996-9~1999-7 新疆大学 | 基础数学 | 硕士 1992-9~1996-7 新疆大学 | 计算数学 | 学士工作经历 2014-7~至今浙江师范大学 1999-7~2014-7 新疆大学科研项目部分集合多重覆盖问题的近似算法, 2018-01-22-2018-01-22, 国家自然科学基金面上项目（2018-2021)（1/10）网络设计中的图论方法, 2018-01-22-2018-01-22, 国家自然科学基金重点项目（2016-2020）（3/5）异构无人智能集群系统的协同理论与方法, 国家自然科学基金应急管理项目（2018-2020）(3/29) 专利自清洁水龙头一种用于智能学习系统的分值设定方法一种用于智能教学的计算机辅助测试方法

研究领域

理论计算机科学运筹学

近期论文

查看导师新发文章（温馨提示：请注意重名现象，建议点开原文通过作者单位确认）

Primal dual based algorithm for degree-balanced spanning tree problem.2018,316:167-173 Fault-Tolerant Virtual Backbone in Heterogeneous Wireless Sensor Network.IEEE/ACM Transactions on Networking.2017,25(6):3487-3499 Approximation Algorithm for Minimum Weight Fault-Tolerant Virtual Backbone in Unit Disk Graphs.IEEE/ACM Transactions on Networking.2017,25(2):925-933 Approximating Maximum Lifetime k-Coverage Through Minimizing Weighted k-Cover in Homogeneous Wireless Sensor Networks.IEEE/ACM Transactions on Networking.2016,24(6):3620-3633 Survey of approximation algorithm on virtual backbone of wireless sensor network.计算机研究与发展.2016,53(1):15-25 Eulerian Subgraphs Containing Given Vertices.SIAM Journal on Discrete Mathematics.2011,25(2):611-621 A PTAS for minimum connected dominating set in 3-dimensional Wireless sensor networks.Journal of Global Optimization.2009,45(3):451-458 Optimal placements of replicas in ring network with majority voting protocol.Journal of Parallel and Distributed Computing.2009,69(5):461-469 A kind of conditional vertex connectivity of star graphs.Applied Mathematics Letters.2009,22(2):264-267 Nowhere-zero flows in tensor product of graphs.2007,54(4):284-292 Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal.Discrete Mathematics.2007,307(2):293-298 A simpler PTAS for connected k-path vertex cover in homogeneous wireless sensor network.Journal of Combinatorial Optimization.2018,Vol.36(No.1):35-43 PTAS for minimum k-path vertex cover in ball graph.Information Processing Letters.2017,Vol.119:9-13 Game-Theoretic Design of Optimal Two-Sided Rating Protocols for Service Exchange Dilemma in Crowdsourcing.IEEE Transactions on Information Forensics and Security.2018,Vol.13(No.11):2801-2815 Supporting user authorization queries in RBAC systems by role–permission reassignment.Future Generation Computer Systems.2018,Vol.88:707-717 Fault-Tolerant Virtual Backbone in Heterogeneous Wireless Sensor Network.IEEE/ACM Transactions on Networking.2017,Vol.25(No.6):3487-3499 Approximation Algorithm for Minimum Weight Fault-Tolerant Virtual Backbone in Unit Disk Graphs.IEEE/ACM Transactions on Networking.2017,Vol.25(No.2):925-933 Performability Analysis of Large-Scale Multi-State Computing Systems..IEEE Transactions on Computers.2018,Vol.67(No.1):59-72 Reliability Evaluation of Network Systems with Dependent Propagated Failures Using Decision Diagrams.IEEE Transactions on Dependable and Secure Computing.2016,Vol.13(No.6):672-683 无线传感器网络虚拟骨干近似算法综述.计算机研究与发展.2016(第1期):15-25 Editorial for Special Issue: COCOA2014.Journal of Combinatorial Optimization.2016,Vol.32(No.4):1196 Partial inverse maximum spanning tree in which weight can only be decreased under $l_p$-norm.Journal of Global Optimization.2018,Vol.70(No.3):677-685 iGreen: green scheduling for peak demand minimization.Journal of Global Optimization.2017,Vol.69(No.1):45-67 Approximation for minimum strongly connected dominating and absorbing set with routing-cost constraint in disk digraphs.Optimization Letters.2016,Vol.10(No.7):1393-1401 Algorithms for the partial inverse matroid problem in which weights can only be increased.Journal of Global Optimization.2016,Vol.65(No.4):801-811 浅探中国传统文化元素在工业设计中的应用.西部皮革.2017,第39卷(第22期):87 A PTAS for minimum weighted connected vertex cover $P_3$ problem in 3-dimensional wireless sensor networks.Journal of Combinatorial Optimization.2017,Vol.33(No.1):106-122 Solution of Bharathi–Kempe–Salek conjecture for influence maximization on arborescence.Journal of Combinatorial Optimization.2017,Vol.33(No.2):803-808 Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming.Mathematical Programming.2018,Vol.169(No.1):255-275 Approximation algorithms for minimum (weight) connected k -path vertex cover.Discrete Applied Mathematics.2016,Vol.205:101-108 Algorithm for constraint partial inverse matroid problem with weight increase forbidden.Theoretical Computer Science.2016,Vol.640:119-124 Approximation algorithms for minimum weight partial connected set cover problem.Journal of Combinatorial Optimization.2016,Vol.31(No.2):696-712 Approximation algorithm for the minimum weight connected $k$-subgraph cover problem..Theoret. Comput. Sci..2014,Vol.535:54-58 Strongly connected dominating and absorbing set in directed disk graph.International Journal of Sensor Networks.2015,Vol.19(No.2):69-77 Approximation algorithms for minimum (weight) connected [formula omitted]-path vertex cover..Discrete Applied Mathematics.2016,Vol.205:101-108 Approximation algorithms for distance constraint sweep coverage with base stations.Journal of Combinatorial Optimization:1-15 Approximation algorithm for the minimum weight connected kappa-subgraph cover problem.Theoretical Computer Science.2014,Vol.535:54-58 Approximation algorithm for the balanced 2-connected k-partition problem.THEORETICAL COMPUTER SCIENCE.2016,Vol.609:627-638 A novel approach for detecting multiple rumor sources in networks with partial observations..Journal of Combinatorial Optimization.2017,Vol.33(No.1):132-146 A PTAS for minimum weighted connected vertex cover $P_3$ problem in 3-dimensional wireless sensor networks..J. Comb. Optim..2017,Vol.33(No.1):106-122 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

学术兼职

中国计算机学会理论计算机专委会委员中国组合数学与图论学会理事中国运筹学会数学规划分会理事中国运筹学会图论组合分会常务理事中国运筹学会理事