Yang Zhou

Orcid: 0000-0001-5692-6281

Affiliations:
  • Shandong Normal University, School of Mathematics and Statistics, Jinan, China


According to our database1, Yang Zhou authored at least 26 papers between 2018 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Stochastic Variance Reduction for DR-Submodular Maximization.
Algorithmica, May, 2024

2023
On maximizing monotone or non-monotone k-submodular functions with the intersection of knapsack and matroid constraints.
J. Comb. Optim., April, 2023

Approximation Algorithms for Matroid and Knapsack Means Problems.
Asia Pac. J. Oper. Res., February, 2023

Random Approximation Algorithms for Monotone k-Submodular Function Maximization with Size Constraints.
Proceedings of the Frontiers of Algorithmics - 17th International Joint Conference, 2023

The Regularized Submodular Maximization via the Lyapunov Method.
Proceedings of the Computing and Combinatorics - 29th International Conference, 2023

DR-Submodular Function Maximization with Adaptive Stepsize.
Proceedings of the Computing and Combinatorics - 29th International Conference, 2023

2022
Streaming algorithms for monotone non-submodular function maximization under a knapsack constraint on the integer lattice.
Theor. Comput. Sci., 2022

The submodularity of two-stage stochastic maximum-weight independent set problems.
Theor. Comput. Sci., 2022

Fast algorithms for supermodular and non-supermodular minimization via bi-criteria strategy.
J. Comb. Optim., 2022

An improved approximation algorithm for maximizing a DR-submodular function over a convex set.
CoRR, 2022

Maximizing Modular plus Non-monotone Submodular Functions.
CoRR, 2022

Non-monotone k-Submodular Function Maximization with Individual Size Constraints.
Proceedings of the Computational Data and Social Networks - 11th International Conference, 2022

A Stochastic Non-monotone DR-Submodular Maximization Problem over a Convex Set.
Proceedings of the Computing and Combinatorics - 28th International Conference, 2022

Guarantees for Maximization of k-Submodular Functions with a Knapsack and a Matroid Constraint.
Proceedings of the Algorithmic Aspects in Information and Management, 2022

2021
Approximation algorithms for fuzzy <i>C</i>-means problem based on seeding method.
Theor. Comput. Sci., 2021

Maximization of Monotone Non-submodular Functions with a Knapsack Constraint over the Integer Lattice.
Proceedings of the Combinatorial Optimization and Applications, 2021

Two-Stage Stochastic Max-Weight Independent Set Problems.
Proceedings of the Combinatorial Optimization and Applications, 2021

Bi-criteria Adaptive Algorithms for Minimizing Supermodular Functions with Cardinality Constraint.
Proceedings of the Algorithmic Aspects in Information and Management, 2021

2020
A class of exact penalty functions and penalty algorithms for nonsmooth constrained optimization problems.
J. Glob. Optim., 2020

Quadrature rules with neighborhood of spherical designs on the two-sphere.
Appl. Math. Comput., 2020

A Novel Initialization Algorithm for Fuzzy <i>C</i>-means Problem.
Proceedings of the Theory and Applications of Models of Computation, 2020

Nonsubmodular Maximization with Knapsack Constraint via Multilinear Extension.
Proceedings of the Parallel Architectures, Algorithms and Programming, 2020

An Adaptive Algorithm for Maximization of Non-submodular Function with a Matroid Constraint.
Proceedings of the Computational Data and Social Networks - 9th International Conference, 2020

A Bi-criteria Analysis for Fuzzy C-means Problem.
Proceedings of the Algorithmic Aspects in Information and Management, 2020

2019
Least-Element Time-Stepping Methods for Simulation of Linear Networks with Ideal Switches.
Circuits Syst. Signal Process., 2019

2018
Spherical t<sub>휀</sub>-designs for approximations on the sphere.
Math. Comput., 2018


  Loading...