Zhao Zhang
According to our database^{1},
Zhao Zhang
authored at least 108 papers
between 2005 and 2020.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepage:

at orcid.org
On csauthors.net:
Bibliography
2020
A bicriteria algorithm for the minimum submodular cost partial set multicover problem.
Theor. Comput. Sci., 2020
Algorithm for Online 3Path Vertex Cover.
Theory Comput. Syst., 2020
2019
Online hole healing for sensor coverage.
J. Global Optimization, 2019
Approximation algorithm for the partial set multicover problem.
J. Global Optimization, 2019
Approximation algorithms for distance constraint sweep coverage with base stations.
J. Comb. Optim., 2019
Quality of barrier cover with wireless sensors.
IJSNet, 2019
Maximisation of the number of βview covered targets in visual sensor networks.
IJSNet, 2019
Approximation algorithms for minimum weight connected 3path vertex cover.
Appl. Math. Comput., 2019
Improved Approximation Algorithm for Minimum Weight kSubgraph Cover Problem.
Proceedings of the Combinatorial Optimization and Applications, 2019
Approximation Algorithms for the Minimum Power Partial Cover Problem.
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
Performability Analysis of LargeScale MultiState Computing Systems.
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_{p}norm.
J. Global Optimization, 2018
A simpler PTAS for connected kpath vertex cover in homogeneous wireless sensor network.
J. Comb. Optim., 2018
Breaking the O(ln n) Barrier: An Enhanced Approximation Algorithm for FaultTolerant Minimum Weight Connected Dominating Set.
INFORMS Journal on Computing, 2018
Computing Minimum kConnected mFold Dominating Set in General Graphs.
INFORMS Journal on Computing, 2018
What network topology can tell in election prediction.
Discrete Math., Alg. and Appl., 2018
Primal dual based algorithm for degreebalanced spanning tree problem.
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
Primal Dual Algorithm for Partial Set Multicover.
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
FaultTolerant Virtual Backbone in Heterogeneous Wireless Sensor Network.
IEEE/ACM Trans. Netw., 2017
Approximation Algorithm for Minimum Weight FaultTolerant Virtual Backbone in Unit Disk Graphs.
IEEE/ACM Trans. Netw., 2017
iGreen: green scheduling for peak demand minimization.
J. Global Optimization, 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
Approximation algorithm for partial positive influence problem in social network.
J. Comb. Optim., 2017
Local ratio method on partial set multicover.
J. Comb. Optim., 2017
Solution of BharathiKempeSalek conjecture for influence maximization on arborescence.
J. Comb. Optim., 2017
PTAS for minimum kpath vertex cover in ball graph.
Inf. Process. Lett., 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
Viral marketing with positive influence.
Proceedings of the 2017 IEEE Conference on Computer Communications, 2017
Networked Stochastic Multiarmed Bandits with Combinatorial Strategies.
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 Sec. Comput., 2016
Approximation algorithm for the balanced 2connected kpartition 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 routingcost constraint in disk digraphs.
Optimization Letters, 2016
Algorithms for the partial inverse matroid problem in which weights can only be increased.
J. Global Optimization, 2016
A greedy algorithm for the minimum 2connected mfold 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.
Discrete Math., Alg. and Appl., 2016
The 01 inverse maximum independent set problem on forests and unicyclic graphs.
Discrete Math., Alg. and Appl., 2016
Approximation algorithms for minimum (weight) connected kpath vertex cover.
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
Minimum cost seed set for competitive social influence.
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
Preface.
Theor. Comput. Sci., 2015
Strongly connected dominating and absorbing set in directed disk graph.
IJSNet, 2015
Degree sequence realizations with given packing and covering of spanning trees.
Discret. Appl. Math., 2015
Approximation Algorithm for Minimum Weight Connected mFold Dominating Set.
CoRR, 2015
Approximation Algorithm for Minimum Weight (k, m)CDS Problem in Unit Disk Graph.
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
Faulttolerant 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 ksubgraph cover problem.
Theor. Comput. Sci., 2014
Minimum vertex cover in ball graphs through local search.
J. Global Optimization, 2014
A greedy algorithm for the faulttolerant connected dominating set in a general graph.
J. Comb. Optim., 2014
Spanning 3connected index of graphs.
J. Comb. Optim., 2014
On the existence of super edgeconnected graphs with prescribed degrees.
Discret. Math., 2014
On strongly Z_{2s1}connected graphs.
Discret. Appl. Math., 2014
Approximation Algorithm for the Balanced 2Connected 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 FaultTolerant Virtual Backbone in Wireless Networks.
IEEE/ACM Trans. Netw., 2013
Optimally restricted edge connected elementary Harary graphs.
Theor. Comput. Sci., 2013
Maxmin weight balanced connected partition.
J. Global Optimization, 2013
Constantapproximation for optimal data aggregation with physical interference.
J. Global Optimization, 2013
A kind of conditional connectivity of Cayley graphs generated by unicyclic graphs.
Inf. Sci., 2013
2012
Radar placement along banks of river.
J. Global Optimization, 2012
Polynomial time approximation scheme for tlatency bounded information propagation problem in wireless networks.
J. Comb. Optim., 2012
Algorithms for the minimum weight kfold (connected) dominating set problem.
J. Comb. Optim., 2012
Diameter Vulnerability of Directed cycles and Directed Tori.
Discrete Math., Alg. and Appl., 2012
A New Proof for ZassenhausGroemerOler inequality.
Discrete Math., Alg. and Appl., 2012
2011
Preface.
Theor. Comput. Sci., 2011
On minimum submodular cover with submodular cost.
J. Global Optimization, 2011
PTAS for minimum weighted connected vertex cover problem with clocal condition in unit disk graphs.
J. Comb. Optim., 2011
Cyclic Connectivity of Star Graph.
Discrete Math., Alg. and 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 dhop connected dominating set in growthbounded graphs.
Optimization Letters, 2010
Sufficient conditions for a graph to be lambda_{k}optimal with given girth and diameter.
Networks, 2010
Fast Information Propagation in Social Networks.
Discrete Math., Alg. and Appl., 2010
The existence and upper bound for two types of restricted connectivity.
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
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 faulttolerant 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 3dimensional Wireless sensor networks.
J. Global Optimization, 2009
A better constantfactor approximation for weighted dominating set in unit disk graph.
J. Comb. Optim., 2009
Two Algorithms for Connected RHop kDominating Set.
Discrete Math., Alg. and Appl., 2009
Edges of degree k in minimally restricted kedge connected graphs.
Discret. Math., 2009
Minimally 3restricted edge connected graphs.
Discret. Appl. Math., 2009
LatencyBounded Minimum Influential Node Selection in Social Networks.
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
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
2005
The transformation graph G^{xyz} when xyz=++.
Discret. Math., 2005