Zhao Zhang

Orcid: 0000-0003-4191-7598

Affiliations:
  • 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 database1, Zhao Zhang authored at least 195 papers between 2003 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Full View Maximum Coverage of Camera Sensors: Moving Object Monitoring.
ACM Trans. Sens. Networks, May, 2024

Approximation algorithms for maximum weighted target cover problem with distance limitations.
J. Comb. Optim., May, 2024

A Game-Enabled Blockchain Consensus and Incentive Mechanism for Secure and Efficient Mobile Crowdsensing.
IEEE Syst. J., March, 2024

A unified approach to approximate partial, prize-collecting, and budgeted sweep cover problems.
Optim. Lett., March, 2024

Selfish bin packing with punishment.
Theor. Comput. Sci., January, 2024

Incentivizing Proportional Fairness for Multi-Task Allocation in Crowdsensing.
IEEE Trans. Serv. Comput., 2024

Approximation Algorithm and FPT Algorithm for Connected-<i>k</i>-Subgraph Cover on Minor-Free Graphs.
Math. Struct. Comput. Sci., 2024

Evolutionary Algorithm on General Cover with Theoretically Guaranteed Approximation Ratio.
INFORMS J. Comput., 2024

2023
A Game Theoretic Approach for a Minimal Secure Dominating Set.
IEEE CAA J. Autom. Sinica, December, 2023

Approximation algorithm for (connected) Italian dominating function.
Discret. Appl. Math., December, 2023

Capitalize Your Data: Optimal Selling Mechanisms for IoT Data Exchange.
IEEE Trans. Mob. Comput., April, 2023

Construction of minimum edge-fault tolerant connected dominating set in a general graph.
J. Comb. Optim., March, 2023

Optimizing Polynomial-Time Solutions to a Network Weighted Vertex Cover Game.
IEEE CAA J. Autom. Sinica, February, 2023

ChainDash: An Ad-Hoc Blockchain Data Analytics System.
Proc. VLDB Endow., 2023

Proof-of-Prospect-Theory: A Novel Game-based Consensus Mechanism for Blockchain.
CoRR, 2023

Approximation Algorithm for Unrooted Prize-Collecting Forest with Multiple Components and Its Application on Prize-Collecting Sweep Coverage.
CoRR, 2023

A Game-Theoretic Approach to Solving the Roman Domination Problem.
CoRR, 2023

Improved Approximation Algorithm for Minimum-Weight (1, m)-Connected Dominating Set.
CoRR, 2023

SChain: Scalable Concurrency over Flexible Permissioned Blockchain.
Proceedings of the 39th IEEE International Conference on Data Engineering, 2023

2022
A Green Stackelberg-game Incentive Mechanism for Multi-service Exchange in Mobile Crowdsensing.
ACM Trans. Internet Techn., 2022

Toward Fairness-Aware Time-Sensitive Asynchronous Federated Learning for Critical Energy Infrastructure.
IEEE Trans. Ind. Informatics, 2022

Approximation algorithm for prize-collecting sweep cover with base stations.
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 multi-cover under a geometric setting.
Optim. Lett., 2022

Nearly tight approximation algorithm for (connected) Roman dominating set.
Optim. Lett., 2022

The price of fairness for a two-agent scheduling game minimizing total completion time.
J. Comb. Optim., 2022

Computation and algorithm for the minimum k-edge-connectivity of graphs.
J. Comb. Optim., 2022

Partial inverse maximum spanning tree problem under the Chebyshev norm.
J. Comb. Optim., 2022

A primal-dual algorithm for the minimum power partial cover problem.
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

A distributed algorithm for a set cover game.
Discret. Math. Algorithms Appl., 2022

Evolution is Still Good: Theoretical Analysis of Evolutionary Algorithms on General Cover Problems.
CoRR, 2022

Approximation Algorithm for Minimum p Union Under a Geometric Setting.
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

Formulate Full View Camera Sensor Coverage by Using Group Set Coverage.
Proceedings of the Wireless Internet - 15th EAI International Conference, 2022

Computing Connected-k-Subgraph Cover with Connectivity Requirement.
Proceedings of the Theory and Applications of Models of Computation, 2022

Improved Parallel Algorithm for Minimum Cost Submodular Cover Problem.
Proceedings of the Conference on Learning Theory, 2-5 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

Minimum power partial multi-cover on a line.
Theor. Comput. Sci., 2021

Approximation algorithm for minimum power partial multi-coverage 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

A Parallel Algorithm for Minimum Cost Submodular Cover.
CoRR, 2021

Parallel approximation for partial set cover.
Appl. Math. Comput., 2021

Laser Marking Hatch Contour Generation Algorithm.
Proceedings of the ICAIIS 2021: 2021 2nd International Conference on Artificial Intelligence and Information Systems, Chongqing, China, May 28, 2021

PEEP: A Parallel Execution Engine for Permissioned Blockchain Systems.
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

Parallel Algorithm for Minimum Partial Dominating Set in Unit Disk Graph.
Proceedings of the Combinatorial Optimization and Applications, 2021

Constant-Approximation for Prize-Collecting Min-Sensor 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 Computing-Empowered Large-Scale Traffic Data Recovery Leveraging Low-Rank Theory.
IEEE Trans. Netw. Sci. Eng., 2020

Reliability Analysis of IoT Networks with Community Structures.
IEEE Trans. Netw. Sci. Eng., 2020

A bicriteria algorithm for the minimum submodular cost partial set multi-cover problem.
Theor. Comput. Sci., 2020

Approximation algorithm for minimum weight connected-<i>k</i>-subgraph cover.
Theor. Comput. Sci., 2020

Approximation algorithm for (connected) bounded-degree deletion problem on unit disk graphs.
Theor. Comput. Sci., 2020

A game theoretic approach for minimal connected dominating set.
Theor. Comput. Sci., 2020

Data mule scheduling on a path with handling time and time span constraints.
Optim. Lett., 2020

Algorithm for Online 3-Path Vertex Cover.
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

A primal-dual algorithm for the minimum partial set multi-cover problem.
J. Comb. Optim., 2020

Approximation algorithm for minimum connected 3-path vertex cover.
Discret. Appl. Math., 2020

2019
Online hole healing for sensor coverage.
J. Glob. Optim., 2019

Approximation algorithm for the partial set multi-cover problem.
J. Glob. Optim., 2019

Approximation algorithms for distance constraint sweep coverage with base stations.
J. Comb. Optim., 2019

Incentive Mechanism for Macrotasking Crowdsourcing: A Zero-Determinant Strategy Approach.
IEEE Internet Things J., 2019

Quality of barrier cover with wireless sensors.
Int. J. Sens. Networks, 2019

Maximisation of the number of β-view covered targets in visual sensor networks.
Int. J. Sens. Networks, 2019

Approximation algorithms for minimum weight connected 3-path vertex cover.
Appl. Math. Comput., 2019

Multi-Level Two-Sided Rating Protocol Design for Service Exchange Contest Dilemma in Crowdsensing.
IEEE Access, 2019

Improved Approximation Algorithm for Minimum Weight k-Subgraph Cover Problem.
Proceedings of the Combinatorial Optimization and Applications, 2019

An Approximation Algorithm for the Dynamic k-level Facility Location Problem.
Proceedings of the Algorithmic Aspects in Information and Management, 2019

Approximation Algorithms for the Minimum Power Partial Cover Problem.
Proceedings of the Algorithmic Aspects in Information and Management, 2019

2018
Breach-Free Sleep-Wakeup Scheduling for Barrier Coverage With Heterogeneous Wireless Sensors.
IEEE/ACM Trans. Netw., 2018

Game-Theoretic Design of Optimal Two-Sided Rating Protocols for Service Exchange Dilemma in Crowdsourcing.
IEEE Trans. Inf. Forensics Secur., 2018

Performability Analysis of Large-Scale Multi-State Computing Systems.
IEEE Trans. Computers, 2018

Solving the degree-concentrated fault-tolerant 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

Circumference of 3-connected cubic graphs.
J. Comb. Theory B, 2018

A simpler PTAS for connected k-path 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 Fault-Tolerant 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 role-permission reassignment.
Future Gener. Comput. Syst., 2018

What network topology can tell in election prediction.
Discret. Math. Algorithms Appl., 2018

Primal dual based algorithm for degree-balanced spanning tree problem.
Appl. Math. Comput., 2018

Approximating the k-Minimum Distance Rumor Source Detection in Online Social Networks.
Proceedings of the 27th International Conference on Computer Communication and Networks, 2018

Primal Dual Algorithm for Partial Set Multi-cover.
Proceedings of the Combinatorial Optimization and Applications, 2018

A Bicriteria Approximation Algorithm for Minimum Submodular Cost Partial Multi-Cover Problem.
Proceedings of the Algorithmic Aspects in Information and Management, 2018

2017
Fault-Tolerant Virtual Backbone in Heterogeneous Wireless Sensor Network.
IEEE/ACM Trans. Netw., 2017

Approximation Algorithm for Minimum Weight Fault-Tolerant Virtual Backbone in Unit Disk Graphs.
IEEE/ACM Trans. Netw., 2017

iGreen: green scheduling for peak demand minimization.
J. Glob. Optim., 2017

A novel approach for detecting multiple rumor sources in networks with partial observations.
J. Comb. Optim., 2017

A simple approximation algorithm for minimum weight partial connected set cover.
J. Comb. Optim., 2017

A PTAS for minimum weighted connected vertex cover $$P_3$$ P 3 problem in 3-dimensional wireless sensor networks.
J. Comb. Optim., 2017

Approximation algorithm for partial positive influence problem in social network.
J. Comb. Optim., 2017

Local ratio method on partial set multi-cover.
J. Comb. Optim., 2017

Solution of Bharathi-Kempe-Salek conjecture for influence maximization on arborescence.
J. Comb. Optim., 2017

PTAS for minimum k-path vertex cover in ball graph.
Inf. Process. Lett., 2017

Game-Theoretic Design of Optimal Two-Sided 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 Multi-Cover Problem.
CoRR, 2017

A Simpler Method to Obtain a PTAS for Connected k-Path Vertex Cover in Unit Disk Graph.
Proceedings of the Wireless Algorithms, Systems, and Applications, 2017

Viral marketing with positive influence.
Proceedings of the 2017 IEEE Conference on Computer Communications, 2017

Networked Stochastic Multi-armed Bandits with Combinatorial Strategies.
Proceedings of the 37th IEEE International Conference on Distributed Computing Systems, 2017

2016
Approximating Maximum Lifetime k-Coverage Through Minimizing Weighted k-Cover 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

Approximation algorithm for the balanced 2-connected k-partition problem.
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 routing-cost 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

Editorial for Special Issue: COCOA2014.
J. Comb. Optim., 2016

A greedy algorithm for the minimum 2-connected m-fold dominating set problem.
J. Comb. Optim., 2016

An approximation algorithm for maximum weight budgeted connected set cover.
J. Comb. Optim., 2016

Approximation algorithms for minimum weight partial connected set cover problem.
J. Comb. Optim., 2016

Restricted connectivity of total digraph.
Discret. Math. Algorithms Appl., 2016

The 0-1 inverse maximum independent set problem on forests and unicyclic graphs.
Discret. Math. Algorithms Appl., 2016

Approximation algorithms for minimum (weight) connected k-path vertex cover.
Discret. Appl. Math., 2016

Approximation Approximation for Fault-Tolerant Virtual Backbone in Wireless Sensor Networks.
CoRR, 2016

Performance Guaranteed Approximation Algorithm for Minimum $k$-Connected $m$-Fold Dominating Set.
CoRR, 2016

Minimum cost seed set for competitive social influence.
Proceedings of the 35th Annual IEEE International Conference on Computer Communications, 2016

Performance-guaranteed approximation algorithm for fault-tolerant connected dominating set in wireless networks.
Proceedings of the 35th Annual IEEE International Conference on Computer Communications, 2016

2015
Preface.
Theor. Comput. Sci., 2015

A PTAS for the minimum weight connected vertex cover P3 problem on unit disk graphs.
Theor. Comput. Sci., 2015

Strongly connected dominating and absorbing set in directed disk graph.
Int. J. Sens. Networks, 2015

Degree sequence realizations with given packing and covering of spanning trees.
Discret. Appl. Math., 2015

Equitable total-coloring of subcubic graphs.
Discret. Appl. Math., 2015

Approximation Algorithm for Minimum Weight Connected m-Fold Dominating Set.
CoRR, 2015

Approximation Algorithm for Minimum Weight (k, m)-CDS Problem in Unit Disk Graph.
CoRR, 2015

Approximation algorithm for minimum weight fault-tolerant virtual backbone in homogeneous wireless sensor network.
Proceedings of the 2015 IEEE Conference on Computer Communications, 2015

Fault-tolerant coverage with maximum lifetime in wireless sensor networks.
Proceedings of the 2015 IEEE Conference on Computer Communications, 2015

2014
Approximation algorithm for the minimum weight connected k-subgraph cover problem.
Theor. Comput. Sci., 2014

Minimum vertex cover in ball graphs through local search.
J. Glob. Optim., 2014

A greedy algorithm for the fault-tolerant connected dominating set in a general graph.
J. Comb. Optim., 2014

Spanning 3-connected index of graphs.
J. Comb. Optim., 2014

The Size of Maximally Irregular Graphs and Maximally Irregular Triangle-Free Graphs.
Graphs Comb., 2014

On the existence of super edge-connected graphs with prescribed degrees.
Discret. Math., 2014

On strongly Z<sub>2s-1</sub>-connected graphs.
Discret. Appl. Math., 2014

Approximation Algorithm for the Balanced 2-Connected Bipartition Problem.
Proceedings of the Computing and Combinatorics - 20th International Conference, 2014

Approximation Algorithm for the Minimum Connected k -Path Vertex Cover Problem.
Proceedings of the Combinatorial Optimization and Applications, 2014

2013
On Construction of Quality Fault-Tolerant Virtual Backbone in Wireless Networks.
IEEE/ACM Trans. Netw., 2013

Optimally restricted edge connected elementary Harary graphs.
Theor. Comput. Sci., 2013

Max-min weight balanced connected partition.
J. Glob. Optim., 2013

Constant-approximation for optimal data aggregation with physical interference.
J. Glob. Optim., 2013

A kind of conditional connectivity of Cayley graphs generated by unicyclic graphs.
Inf. Sci., 2013

2012
Radar placement along banks of river.
J. Glob. Optim., 2012

Polynomial time approximation scheme for t-latency bounded information propagation problem in wireless networks.
J. Comb. Optim., 2012

Algorithms for the minimum weight k-fold (connected) dominating set problem.
J. Comb. Optim., 2012

On cyclic vertex-connectivity of Cartesian product digraphs.
J. Comb. Optim., 2012

Diameter Vulnerability of Directed cycles and Directed Tori.
Discret. Math. Algorithms Appl., 2012

A New Proof for Zassenhaus-Groemer-Oler inequality.
Discret. Math. Algorithms Appl., 2012

On the connectivity of p-diamond-free vertex transitive graphs.
Discret. Appl. Math., 2012

Edge fault tolerance of graphs with respect to super edge connectivity.
Discret. Appl. Math., 2012

2011
Preface.
Theor. Comput. Sci., 2011

On minimum submodular cover with submodular cost.
J. Glob. Optim., 2011

Super cyclically edge connected transitive graphs.
J. Comb. Optim., 2011

PTAS for minimum weighted connected vertex cover problem with c-local condition in unit disk graphs.
J. Comb. Optim., 2011

Cyclic Connectivity of Star Graph.
Discret. Math. Algorithms Appl., 2011

Restricted Edge Connectivity of Harary Graphs.
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 growth-bounded 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

Fast Information Propagation in Social Networks.
Discret. Math. Algorithms Appl., 2010

The existence and upper bound for two types of restricted connectivity.
Discret. Appl. Math., 2010

Double-super-connected digraphs.
Discret. Appl. Math., 2010

A New Constant Factor Approximation for Computing 3-Connected m-Dominating Sets in Homogeneous Wireless Networks.
Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010

Cyclic Vertex Connectivity of Star Graphs.
Proceedings of the Combinatorial Optimization and Applications, 2010

2009
PTAS for connected vertex cover in unit disk graphs.
Theor. Comput. Sci., 2009

Algorithms for connected set cover problem and fault-tolerant connected set cover problem.
Theor. Comput. Sci., 2009

Construction of strongly connected dominating sets in asymmetric multihop wireless networks.
Theor. Comput. Sci., 2009

Optimal placements of replicas in a ring network with majority voting protocol.
J. Parallel Distributed Comput., 2009

A PTAS for minimum connected dominating set in 3-dimensional Wireless sensor networks.
J. Glob. Optim., 2009

A better constant-factor approximation for weighted dominating set in unit disk graph.
J. Comb. Optim., 2009

Two Algorithms for Connected R-Hop k-Dominating Set.
Discret. Math. Algorithms Appl., 2009

On cyclic edge-connectivity of transitive graphs.
Discret. Math., 2009

Edges of degree k in minimally restricted k-edge connected graphs.
Discret. Math., 2009

Super-connected arc-transitive digraphs.
Discret. Appl. Math., 2009

Minimally 3-restricted edge connected graphs.
Discret. Appl. Math., 2009

Latency-Bounded Minimum Influential Node Selection in Social Networks.
Proceedings of the Wireless Algorithms, 2009

Three Approximation Algorithms for Energy-Efficient Query Dissemination in Sensor Database System.
Proceedings of the Database and Expert Systems Applications, 20th International Conference, 2009

2008
Super-connected edge transitive graphs.
Discret. Appl. Math., 2008

Minimally restricted edge connected graphs.
Appl. Math. Lett., 2008

PTAS for Minimum Connected Dominating Set in Unit Ball Graph.
Proceedings of the Wireless Algorithms, 2008

Recyclable Connected Dominating Set for Large Scale Dynamic Wireless Networks.
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

(6+epsilon)-Approximation for Minimum Weight Dominating Set in Unit Disk Graphs.
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
Super-Connectivity and Hyper-Connectivity of Vertex Transitive Bipartite Graphs.
Graphs Comb., 2007

2006
Semi-hyper-connected edge transitive graphs.
Discret. Math., 2006

On optimally-<i>lambda</i><sup>(3)</sup> transitive graphs.
Discret. Appl. Math., 2006

Restricted Edge Connectivity of Edge Transitive Graphs.
Ars Comb., 2006

2005
The transformation graph <i>G<sup>xyz</sup></i> when <i>xyz</i>=-++.
Discret. Math., 2005

2003
Number of minimum vertex cuts in transitive graphs.
Discret. Math., 2003


  Loading...