Zhao Zhang
Orcid: 0000000341917598Affiliations:
 Zhejiang Normal University, College of Mathematics Physics and Information Engineering, Jinhua, China
 Xinjiang University, College of Mathematics and System Sciences, Urmuqi, China (1999  2014)
According to our database^{1},
Zhao Zhang
authored at least 195 papers
between 2003 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:

on orcid.org
On csauthors.net:
Bibliography
2024
ACM Trans. Sens. Networks, May, 2024
Approximation algorithms for maximum weighted target cover problem with distance limitations.
J. Comb. Optim., May, 2024
A GameEnabled Blockchain Consensus and Incentive Mechanism for Secure and Efficient Mobile Crowdsensing.
IEEE Syst. J., March, 2024
A unified approach to approximate partial, prizecollecting, and budgeted sweep cover problems.
Optim. Lett., March, 2024
Theor. Comput. Sci., January, 2024
IEEE Trans. Serv. Comput., 2024
Approximation Algorithm and FPT Algorithm for Connected<i>k</i>Subgraph Cover on MinorFree Graphs.
Math. Struct. Comput. Sci., 2024
Evolutionary Algorithm on General Cover with Theoretically Guaranteed Approximation Ratio.
INFORMS J. Comput., 2024
2023
IEEE CAA J. Autom. Sinica, December, 2023
Discret. Appl. Math., December, 2023
IEEE Trans. Mob. Comput., April, 2023
Construction of minimum edgefault tolerant connected dominating set in a general graph.
J. Comb. Optim., March, 2023
IEEE CAA J. Autom. Sinica, February, 2023
Proc. VLDB Endow., 2023
CoRR, 2023
Approximation Algorithm for Unrooted PrizeCollecting Forest with Multiple Components and Its Application on PrizeCollecting Sweep Coverage.
CoRR, 2023
CoRR, 2023
Improved Approximation Algorithm for MinimumWeight (1, m)Connected Dominating Set.
CoRR, 2023
Proceedings of the 39th IEEE International Conference on Data Engineering, 2023
2022
A Green Stackelberggame Incentive Mechanism for Multiservice Exchange in Mobile Crowdsensing.
ACM Trans. Internet Techn., 2022
Toward FairnessAware TimeSensitive Asynchronous Federated Learning for Critical Energy Infrastructure.
IEEE Trans. Ind. Informatics, 2022
Theor. Comput. Sci., 2022
Parallel algorithms for minimum general partial dominating set and maximum budgeted dominating set in unit disk graph.
Theor. Comput. Sci., 2022
Approximation algorithm for minimum partial multicover under a geometric setting.
Optim. Lett., 2022
Optim. Lett., 2022
The price of fairness for a twoagent scheduling game minimizing total completion time.
J. Comb. Optim., 2022
J. Comb. Optim., 2022
J. Comb. Optim., 2022
J. Comb. Optim., 2022
An asymptotically tight online algorithm for <i>m</i>Steiner Traveling Salesman Problem.
Inf. Process. Lett., 2022
Constant Approximation for the Lifetime Scheduling Problem of <i>p</i>Percent Coverage.
INFORMS J. Comput., 2022
Discret. Math. Algorithms Appl., 2022
Evolution is Still Good: Theoretical Analysis of Evolutionary Algorithms on General Cover Problems.
CoRR, 2022
CoRR, 2022
A parallel algorithm for minimum weight set cover with small neighborhood property.
CoRR, 2022
Performance Guaranteed Evolutionary Algorithm for Minimum Connected Dominating Set.
CoRR, 2022
Proceedings of the Wireless Internet  15th EAI International Conference, 2022
Proceedings of the Theory and Applications of Models of Computation, 2022
Proceedings of the Conference on Learning Theory, 25 July 2022, London, UK., 2022
2021
Extortion and Cooperation in Rating Protocol Design for Competitive Crowdsourcing.
IEEE Trans. Comput. Soc. Syst., 2021
Approximation algorithms for the dynamic <i>k</i>level facility location problems.
Theor. Comput. Sci., 2021
Theor. Comput. Sci., 2021
Approximation algorithm for minimum power partial multicoverage in wireless sensor networks.
J. Glob. Optim., 2021
Breaking the <i>r</i><sub>max</sub> Barrier: Enhanced Approximation Algorithms for Partial Set Multicover Problem.
INFORMS J. Comput., 2021
CoRR, 2021
Appl. Math. Comput., 2021
Proceedings of the ICAIIS 2021: 2021 2nd International Conference on Artificial Intelligence and Information Systems, Chongqing, China, May 28, 2021
Proceedings of the Database Systems for Advanced Applications, 2021
Capacitated Partial Inverse Maximum Spanning Tree Under the Weighted l<sub>∞ </sub>norm.
Proceedings of the Combinatorial Optimization and Applications, 2021
Proceedings of the Combinatorial Optimization and Applications, 2021
ConstantApproximation for PrizeCollecting MinSensor Sweep Coverage with Base Stations.
Proceedings of the Algorithmic Aspects in Information and Management, 2021
2020
Online Rating Protocol Using Endogenous and Incremental Learning Design for Mobile Crowdsensing.
IEEE Trans. Veh. Technol., 2020
Edge ComputingEmpowered LargeScale Traffic Data Recovery Leveraging LowRank Theory.
IEEE Trans. Netw. Sci. Eng., 2020
IEEE Trans. Netw. Sci. Eng., 2020
A bicriteria algorithm for the minimum submodular cost partial set multicover problem.
Theor. Comput. Sci., 2020
Theor. Comput. Sci., 2020
Approximation algorithm for (connected) boundeddegree deletion problem on unit disk graphs.
Theor. Comput. Sci., 2020
Theor. Comput. Sci., 2020
Optim. Lett., 2020
Theory Comput. Syst., 2020
Approximation algorithms for capacitated partial inverse maximum spanning tree problem.
J. Glob. Optim., 2020
Approximation algorithm for a generalized Roman domination problem in unit ball graphs.
J. Comb. Optim., 2020
J. Comb. Optim., 2020
Discret. Appl. Math., 2020
2019
J. Glob. Optim., 2019
J. Glob. Optim., 2019
Approximation algorithms for distance constraint sweep coverage with base stations.
J. Comb. Optim., 2019
Incentive Mechanism for Macrotasking Crowdsourcing: A ZeroDeterminant Strategy Approach.
IEEE Internet Things J., 2019
Int. J. Sens. Networks, 2019
Int. J. Sens. Networks, 2019
Appl. Math. Comput., 2019
MultiLevel TwoSided Rating Protocol Design for Service Exchange Contest Dilemma in Crowdsensing.
IEEE Access, 2019
Proceedings of the Combinatorial Optimization and Applications, 2019
Proceedings of the Algorithmic Aspects in Information and Management, 2019
Proceedings of the Algorithmic Aspects in Information and Management, 2019
2018
BreachFree SleepWakeup Scheduling for Barrier Coverage With Heterogeneous Wireless Sensors.
IEEE/ACM Trans. Netw., 2018
GameTheoretic Design of Optimal TwoSided Rating Protocols for Service Exchange Dilemma in Crowdsourcing.
IEEE Trans. Inf. Forensics Secur., 2018
IEEE Trans. Computers, 2018
Solving the degreeconcentrated faulttolerant spanning subgraph problem by DC programming.
Math. Program., 2018
Partial inverse maximum spanning tree in which weight can only be decreased under l<sub>p</sub>norm.
J. Glob. Optim., 2018
J. Comb. Theory B, 2018
A simpler PTAS for connected kpath vertex cover in homogeneous wireless sensor network.
J. Comb. Optim., 2018
Breaking the <i>O</i>(ln <i>n</i>) Barrier: An Enhanced Approximation Algorithm for FaultTolerant Minimum Weight Connected Dominating Set.
INFORMS J. Comput., 2018
Computing Minimum <i>k</i>Connected <i>m</i>Fold Dominating Set in General Graphs.
INFORMS J. Comput., 2018
Supporting user authorization queries in RBAC systems by rolepermission reassignment.
Future Gener. Comput. Syst., 2018
Discret. Math. Algorithms Appl., 2018
Appl. Math. Comput., 2018
Approximating the kMinimum Distance Rumor Source Detection in Online Social Networks.
Proceedings of the 27th International Conference on Computer Communication and Networks, 2018
Proceedings of the Combinatorial Optimization and Applications, 2018
A Bicriteria Approximation Algorithm for Minimum Submodular Cost Partial MultiCover Problem.
Proceedings of the Algorithmic Aspects in Information and Management, 2018
2017
IEEE/ACM Trans. Netw., 2017
Approximation Algorithm for Minimum Weight FaultTolerant Virtual Backbone in Unit Disk Graphs.
IEEE/ACM Trans. Netw., 2017
J. Glob. Optim., 2017
A novel approach for detecting multiple rumor sources in networks with partial observations.
J. Comb. Optim., 2017
J. Comb. Optim., 2017
A PTAS for minimum weighted connected vertex cover $$P_3$$ P 3 problem in 3dimensional wireless sensor networks.
J. Comb. Optim., 2017
J. Comb. Optim., 2017
J. Comb. Optim., 2017
Solution of BharathiKempeSalek conjecture for influence maximization on arborescence.
J. Comb. Optim., 2017
Inf. Process. Lett., 2017
GameTheoretic Design of Optimal TwoSided Rating Protocols for Service Exchange Dilemma in Crowdsourcing.
CoRR, 2017
Rating Protocol Design for Extortion and Cooperation in the Crowdsourcing Contest Dilemma.
CoRR, 2017
Randomized Approximation Algorithm for Minimum Submodular Cost Partial MultiCover Problem.
CoRR, 2017
A Simpler Method to Obtain a PTAS for Connected kPath Vertex Cover in Unit Disk Graph.
Proceedings of the Wireless Algorithms, Systems, and Applications, 2017
Proceedings of the 2017 IEEE Conference on Computer Communications, 2017
Proceedings of the 37th IEEE International Conference on Distributed Computing Systems, 2017
2016
Approximating Maximum Lifetime kCoverage Through Minimizing Weighted kCover in Homogeneous Wireless Sensor Networks.
IEEE/ACM Trans. Netw., 2016
Reliability Evaluation of Network Systems with Dependent Propagated Failures Using Decision Diagrams.
IEEE Trans. Dependable Secur. Comput., 2016
Theor. Comput. Sci., 2016
Algorithm for constraint partial inverse matroid problem with weight increase forbidden.
Theor. Comput. Sci., 2016
Approximation for minimum strongly connected dominating and absorbing set with routingcost constraint in disk digraphs.
Optim. Lett., 2016
Algorithms for the partial inverse matroid problem in which weights can only be increased.
J. Glob. Optim., 2016
J. Comb. Optim., 2016
J. Comb. Optim., 2016
J. Comb. Optim., 2016
J. Comb. Optim., 2016
Discret. Math. Algorithms Appl., 2016
Discret. Math. Algorithms Appl., 2016
Discret. Appl. Math., 2016
Approximation Approximation for FaultTolerant Virtual Backbone in Wireless Sensor Networks.
CoRR, 2016
Performance Guaranteed Approximation Algorithm for Minimum $k$Connected $m$Fold Dominating Set.
CoRR, 2016
Proceedings of the 35th Annual IEEE International Conference on Computer Communications, 2016
Performanceguaranteed approximation algorithm for faulttolerant connected dominating set in wireless networks.
Proceedings of the 35th Annual IEEE International Conference on Computer Communications, 2016
2015
Theor. Comput. Sci., 2015
A PTAS for the minimum weight connected vertex cover P3 problem on unit disk graphs.
Theor. Comput. Sci., 2015
Int. J. Sens. Networks, 2015
Discret. Appl. Math., 2015
Discret. Appl. Math., 2015
CoRR, 2015
CoRR, 2015
Approximation algorithm for minimum weight faulttolerant virtual backbone in homogeneous wireless sensor network.
Proceedings of the 2015 IEEE Conference on Computer Communications, 2015
Proceedings of the 2015 IEEE Conference on Computer Communications, 2015
2014
Approximation algorithm for the minimum weight connected ksubgraph cover problem.
Theor. Comput. Sci., 2014
J. Glob. Optim., 2014
A greedy algorithm for the faulttolerant connected dominating set in a general graph.
J. Comb. Optim., 2014
J. Comb. Optim., 2014
The Size of Maximally Irregular Graphs and Maximally Irregular TriangleFree Graphs.
Graphs Comb., 2014
Discret. Math., 2014
Discret. Appl. Math., 2014
Proceedings of the Computing and Combinatorics  20th International Conference, 2014
Proceedings of the Combinatorial Optimization and Applications, 2014
2013
IEEE/ACM Trans. Netw., 2013
Theor. Comput. Sci., 2013
J. Glob. Optim., 2013
J. Glob. Optim., 2013
A kind of conditional connectivity of Cayley graphs generated by unicyclic graphs.
Inf. Sci., 2013
2012
J. Glob. Optim., 2012
Polynomial time approximation scheme for tlatency bounded information propagation problem in wireless networks.
J. Comb. Optim., 2012
J. Comb. Optim., 2012
J. Comb. Optim., 2012
Discret. Math. Algorithms Appl., 2012
Discret. Math. Algorithms Appl., 2012
Discret. Appl. Math., 2012
Discret. Appl. Math., 2012
2011
Theor. Comput. Sci., 2011
J. Glob. Optim., 2011
J. Comb. Optim., 2011
PTAS for minimum weighted connected vertex cover problem with clocal condition in unit disk graphs.
J. Comb. Optim., 2011
Discret. Math. Algorithms Appl., 2011
Proceedings of the Combinatorial Optimization and Applications, 2011
2010
A Better Approximation Algorithm for Computing Connected Dominating Sets in Unit Ball Graphs.
IEEE Trans. Mob. Comput., 2010
A PTAS for minimum <i>d</i>hop connected dominating set in growthbounded graphs.
Optim. Lett., 2010
Sufficient conditions for a graph to be lambda<sub><i>k</i></sub>optimal with given girth and diameter.
Networks, 2010
Discret. Math. Algorithms Appl., 2010
Discret. Appl. Math., 2010
Discret. Appl. Math., 2010
A New Constant Factor Approximation for Computing 3Connected mDominating Sets in Homogeneous Wireless Networks.
Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010
Proceedings of the Combinatorial Optimization and Applications, 2010
2009
Theor. Comput. Sci., 2009
Algorithms for connected set cover problem and faulttolerant connected set cover problem.
Theor. Comput. Sci., 2009
Construction of strongly connected dominating sets in asymmetric multihop wireless networks.
Theor. Comput. Sci., 2009
J. Parallel Distributed Comput., 2009
A PTAS for minimum connected dominating set in 3dimensional Wireless sensor networks.
J. Glob. Optim., 2009
A better constantfactor approximation for weighted dominating set in unit disk graph.
J. Comb. Optim., 2009
Discret. Math. Algorithms Appl., 2009
Discret. Math., 2009
Discret. Math., 2009
Discret. Appl. Math., 2009
Discret. Appl. Math., 2009
Proceedings of the Wireless Algorithms, 2009
Three Approximation Algorithms for EnergyEfficient Query Dissemination in Sensor Database System.
Proceedings of the Database and Expert Systems Applications, 20th International Conference, 2009
2008
Discret. Appl. Math., 2008
Appl. Math. Lett., 2008
Proceedings of the Wireless Algorithms, 2008
Proceedings of the Wireless Algorithms, 2008
Minimum Power Strongly Connected Dominating Sets in Wireless Networks.
Proceedings of the 2008 International Conference on Wireless Networks, 2008
Optimal Placements in Ring Network for Data Replicas in Distributed Database with MajorityVoting Protocol.
Proceedings of the 28th IEEE International Conference on Distributed Computing Systems (ICDCS 2008), 2008
Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008
Polynomial Time Approximation Scheme for Connected Vertex Cover in Unit Disk Graph.
Proceedings of the Combinatorial Optimization and Applications, 2008
2007
Graphs Comb., 2007
2006
Discret. Math., 2006
Discret. Appl. Math., 2006
Restricted Edge Connectivity of Edge Transitive Graphs.
Ars Comb., 2006
2005
Discret. Math., 2005
2003
Discret. Math., 2003