Zhao Zhang

From MaRDI portal



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Approximation algorithm for unrooted prize-collecting forest with multiple components and its application on prize-collecting sweep coverage
Mathematical Programming. Series A. Series B
2026-09-16Paper
A constant approximation algorithm for fair submodular maximization under a knapsack constraint
Operations Research Letters
2026-09-14Paper
Non-submodular optimization and non-convex relaxation2026-07-15Paper
Learn to optimize from structured samples for minimum partial set cover
Discrete Mathematics, Algorithms and Applications
2026-05-20Paper
Partial interval multicover: approximation and complexity
Theoretical Computer Science
2026-05-11Paper
Different vibration-switching modes induced by pulse-shaped explosion in a hybrid van der Pol-Rayleigh-Duffing system
Chinese Journal of Physics (Taipei)
2026-04-29Paper
Approximation algorithm for fair stochastic maximum coverage problem
Theoretical Computer Science
2026-02-04Paper
Bootstrapping the R-matrix
(available as arXiv preprint)
2026-01-01Paper
Resonating Valence Bond Ground States on Corner-sharing Simplices
(available as arXiv preprint)
2026-01-01Paper
Exact critical exponents of the Motzkin and Fredkin Chains
(available as arXiv preprint)
2026-01-01Paper
Integrable Free and Interacting Fermions
(available as arXiv preprint)
2026-01-01Paper
Encoded Forward Backward Stochastic Neural Network for High-Dimensional Backward Stochastic Differential Equations and Parabolic Partial Differential Equations
(available as arXiv preprint)
2026-01-01Paper
The Yang-Baxter Equation for the Chiral Potts Model and Integrable Parafermions
(available as arXiv preprint)
2026-01-01Paper
Multi-set function maximization with application in viral marketing
Journal of Combinatorial Optimization
2026-01-01Paper
Minimum power partial cover meets fairness: improved approximation guarantees
Journal of Combinatorial Optimization
2026-01-01Paper
An approximation algorithm for the prize-collecting connected dominating set problem
Optimization Letters
2025-11-26Paper
A new approximation algorithm for minimum-weight (1,m)-connected dominating set
INFORMS Journal on Computing
2025-11-19Paper
Minimum power partial cover with fairness constraint2025-10-29Paper
Global approximation of local optimality: nonsubmodular optimization
Journal of the Operations Research Society of China
2025-09-03Paper
A 1/2-approximation algorithm for maximum interval multi-cover
Theoretical Computer Science
2025-07-21Paper
Approximation algorithms for the total dominating set problem
Journal of Combinatorial Optimization
2025-07-18Paper
Approximation algorithm for prize-collecting weighted set cover with fairness constraints
Discrete Applied Mathematics
2025-06-30Paper
Approximation algorithm for min sweep-period sweep cover with distance constraint
Discrete Mathematics, Algorithms and Applications
2025-05-15Paper
Exploring two new iterative methods for solving absolute value equations
Journal of Applied Mathematics and Computing
2025-05-06Paper
Approximation algorithm for the minimum interval partial multi-cover problem
Networks
2025-03-14Paper
Active fault diagnosis for LPV systems based on constrained zonotopes
IEEE Transactions on Automatic Control
2025-01-21Paper
Highly Entangled 2D Ground States: Tensor Network, Order Parameter and Correlation
(available as arXiv preprint)
2025-01-01Paper
The Motzkin Spaghetto
(available as arXiv preprint)
2025-01-01Paper
Stochastic Finite Volume Approximation with Clustering in the Parameter Space for Forward Uncertainty Quantification of PDEs with Random Parameters
(available as arXiv preprint)
2025-01-01Paper
Spatiotemporally Localized Optical Links and Knots
(available as arXiv preprint)
2025-01-01Paper
Approximation algorithm for prize-collecting vertex cover with fairness constraints
Journal of Combinatorial Optimization
2024-12-03Paper
Adaptive influence maximization: adaptability via nonadaptability
INFORMS Journal on Computing
2024-11-20Paper
Approximation algorithm and FPT algorithm for connected-\(k\)-subgraph cover on minor-free graphs
Mathematical Structures in Computer Science
2024-10-16Paper
Evolutionary algorithm on general cover with theoretically guaranteed approximation ratio
INFORMS Journal on Computing
2024-07-29Paper
Approximation algorithms for maximum weighted target cover problem with distance limitations
Journal of Combinatorial Optimization
2024-07-11Paper
Approximation algorithm for the minimum partial connected Roman dominating set problem
Journal of Combinatorial Optimization
2024-07-11Paper
A unified approach to approximate partial, prize-collecting, and budgeted sweep cover problems
Optimization Letters
2024-03-11Paper
Approximation algorithms for the minimum power partial cover problem
Algorithmic Aspects in Information and Management
2024-02-23Paper
An approximation algorithm for the dynamic \(k\)-level facility location problem
Algorithmic Aspects in Information and Management
2024-02-23Paper
Approximation algorithm for the maximum interval multi-cover problem2024-01-01Paper
A distributed approximation algorithm for the total dominating set problem2024-01-01Paper
Approximation algorithm for (connected) Italian dominating function
Discrete Applied Mathematics
2023-11-13Paper
A Computational Approach to Optimal Control Problems with Almost Smooth Controls
Asia-Pacific Journal of Operational Research
2023-10-19Paper
A bicriteria approximation algorithm for minimum submodular cost partial multi-cover problem
Algorithmic Aspects in Information and Management
2023-10-16Paper
Computing connected-k-subgraph cover with connectivity requirement
Lecture Notes in Computer Science
2023-08-04Paper
An Analytic Model for Cluster-Based Wireless Sensor Networks
INFOR: Information Systems and Operational Research
2023-05-09Paper
Construction of minimum edge-fault tolerant connected dominating set in a general graph
Journal of Combinatorial Optimization
2023-04-14Paper
Ergodic Archimedean dimers
(available as arXiv preprint)
2023-01-01Paper
Constant approximation for the lifetime scheduling problem of \(p\)-percent coverage
INFORMS Journal on Computing
2022-12-01Paper
Partial inverse maximum spanning tree problem under the Chebyshev norm
Journal of Combinatorial Optimization
2022-10-31Paper
Nearly tight approximation algorithm for (connected) Roman dominating set
Optimization Letters
2022-10-11Paper
A primal-dual algorithm for the minimum power partial cover problem
Journal of Combinatorial Optimization
2022-10-04Paper
The price of fairness for a two-agent scheduling game minimizing total completion time
Journal of Combinatorial Optimization
2022-10-04Paper
Parallel algorithms for minimum general partial dominating set and maximum budgeted dominating set in unit disk graph
Theoretical Computer Science
2022-09-14Paper
Approximation algorithm for prize-collecting sweep cover with base stations
Theoretical Computer Science
2022-08-25Paper
Algorithms for covering multiple submodular constraints and applications
Journal of Combinatorial Optimization
2022-08-19Paper
Constant-approximation for prize-collecting min-sensor sweep coverage with base stations2022-07-01Paper
Capacitated partial inverse maximum spanning tree under the weighted \(l_{\infty }\)-norm2022-06-29Paper
Parallel algorithm for minimum partial dominating set in unit disk graph2022-06-29Paper
A Role of Minimum Spanning Tree
Nonlinear Combinatorial Optimization
2022-06-10Paper
Discrete Newton Method
Nonlinear Combinatorial Optimization
2022-06-10Paper
Nonsubmodular Optimization
Nonlinear Combinatorial Optimization
2022-06-10Paper
A distributed algorithm for a set cover game
Discrete Mathematics, Algorithms and Applications
2022-06-10Paper
scientific article; zbMATH DE number 7491960 (Why is no real title available?)2022-03-17Paper
Approximation algorithm for minimum partial multi-cover under a geometric setting
Optimization Letters
2022-03-15Paper
Hidden Bethe states in a partially integrable model
(available as arXiv preprint)
2022-01-01Paper
Probabilistic algorithm for minimum \(k\)-fold dominating set problem
SCIENTIA SINICA Mathematica
2021-12-17Paper
An asymptotically tight online algorithm for \(m\)-steiner traveling salesman problem
Information Processing Letters
2021-12-14Paper
Parallel approximation for partial set cover
Applied Mathematics and Computation
2021-11-11Paper
Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks
Journal of Global Optimization
2021-08-17Paper
Improved Parallel Algorithm for Minimum Cost Submodular Cover Problem2021-08-09Paper
Breaking the<i>r</i><sub>max</sub>Barrier: Enhanced Approximation Algorithms for Partial Set Multicover Problem
INFORMS Journal on Computing
2021-06-23Paper
Minimum power partial multi-cover on a line
Theoretical Computer Science
2021-04-08Paper
Data mule scheduling on a path with handling time and time span constraints
Optimization Letters
2021-02-17Paper
Approximation algorithms for the dynamic \(k\)-level facility location problems
Theoretical Computer Science
2021-01-25Paper
Improved Parallel Algorithm for Minimum Cost Submodular Cover Problem
(available as arXiv preprint)
2021-01-01Paper
Computing Minimum <i>k</i>-Connected <i>m</i>-Fold Dominating Set in General Graphs
INFORMS Journal on Computing
2020-11-09Paper
Breaking the <i>O</i>(ln <i>n</i>) Barrier: An Enhanced Approximation Algorithm for Fault-Tolerant Minimum Weight Connected Dominating Set
INFORMS Journal on Computing
2020-11-09Paper
Approximation algorithm for minimum connected 3-path vertex cover
Discrete Applied Mathematics
2020-10-14Paper
Optimal coverage in wireless sensor networks
Springer Optimization and Its Applications
2020-09-03Paper
Approximation algorithm for minimum weight connected-\(k\)-subgraph cover
Theoretical Computer Science
2020-09-01Paper
A game theoretic approach for minimal connected dominating set
Theoretical Computer Science
2020-08-25Paper
Approximation algorithm for (connected) bounded-degree deletion problem on unit disk graphs
Theoretical Computer Science
2020-08-25Paper
Improved approximation algorithm for minimum weight \(k\)-subgraph cover problem2020-05-13Paper
Approximation algorithms for capacitated partial inverse maximum spanning tree problem
Journal of Global Optimization
2020-05-04Paper
A primal-dual algorithm for the minimum partial set multi-cover problem
Journal of Combinatorial Optimization
2020-03-24Paper
Algorithm for online 3-path vertex cover
Theory of Computing Systems
2020-02-27Paper
Approximation algorithm for a generalized Roman domination problem in unit ball graphs
Journal of Combinatorial Optimization
2020-02-03Paper
A bicriteria algorithm for the minimum submodular cost partial set multi-cover problem
Theoretical Computer Science
2019-12-27Paper
Online hole healing for sensor coverage
Journal of Global Optimization
2019-12-03Paper
Approximation algorithm for the partial set multi-cover problem
Journal of Global Optimization
2019-12-03Paper
Approximation algorithms for minimum weight connected 3-path vertex cover
Applied Mathematics and Computation
2019-11-26Paper
Primal dual algorithm for partial set multi-cover2019-10-11Paper
Set function optimization
Journal of the Operations Research Society of China
2019-07-19Paper
Approximation algorithms for distance constraint sweep coverage with base stations
Journal of Combinatorial Optimization
2019-06-25Paper
Primal dual based algorithm for degree-balanced spanning tree problem
Applied Mathematics and Computation
2019-04-29Paper
Extremality and Sharp Bounds for the k-edge-connectivity of Graphs2019-01-18Paper
Extremality and Sharp Bounds for the $k$-edge-connectivity of Graphs
(available as arXiv preprint)
2019-01-01Paper
A simpler PTAS for connected k-path vertex cover in homogeneous wireless sensor network
Journal of Combinatorial Optimization
2018-07-26Paper
Performability Analysis of Large-Scale Multi-State Computing Systems
IEEE Transactions on Computers
2018-06-27Paper
← Previous 100   1   2   3   Next 100 →


Research outcomes over time


This page was built for person: Zhao Zhang