Zishen Yang

According to our database1, Zishen Yang authored at least 16 papers between 2016 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Greedy Guarantees for Non-submodular Function Maximization Under Independent System Constraint with Applications.
J. Optim. Theory Appl., February, 2023

Greedy guarantees for minimum submodular cost submodular/non-submodular cover problem.
J. Comb. Optim., 2023

2021
Greedy approximation for the minimum connected dominating set with labeling.
Optim. Lett., 2021

Algorithms and Complexity for a Class of Combinatorial Optimization Problems with Labelling.
J. Optim. Theory Appl., 2021

On multi-path routing for reliable communications in failure interdependent complex networks.
J. Comb. Optim., 2021

Non-monotone submodular function maximization under k-system constraint.
J. Comb. Optim., 2021

The t-latency bounded strong target set selection problem in some kinds of special family of graphs.
J. Comb. Optim., 2021

Minimum non-submodular cover problem with applications.
Appl. Math. Comput., 2021

2019
The connected vertex cover problem in k-regular graphs.
J. Comb. Optim., 2019

Some results for the two disjoint connected dominating sets problem.
Discret. Math. Algorithms Appl., 2019

2018
Algorithm and complexity of the two disjoint connected dominating sets problem on trees.
Appl. Math. Comput., 2018

2017
Complexity and algorithms for the connected vertex cover problem in 4-regular graphs.
Appl. Math. Comput., 2017

On Interdependent Failure Resilient Multi-path Routing in Smart Grid Communication Network.
Proceedings of the Combinatorial Optimization and Applications, 2017

2016
The first constant factor approximation for minimum partial connected dominating set problem in growth-bounded graphs.
Wirel. Networks, 2016

Exact solutions for Latency-Bounded Target Set Selection Problem on some special families of graphs.
Discret. Appl. Math., 2016

Cost effective mobile and static road side unit deployment for vehicular adhoc networks.
Proceedings of the 2016 International Conference on Computing, 2016


  Loading...