| Publication | Date of Publication | Type |
|---|
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-16 | Paper |
A constant approximation algorithm for fair submodular maximization under a knapsack constraint
Operations Research Letters | 2026-09-14 | Paper |
Learn to optimize from structured samples for minimum partial set cover
Discrete Mathematics, Algorithms and Applications | 2026-05-20 | Paper |
Partial interval multicover: approximation and complexity
Theoretical Computer Science | 2026-05-11 | Paper |
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-29 | Paper |
Approximation algorithm for fair stochastic maximum coverage problem
Theoretical Computer Science | 2026-02-04 | Paper |
An approximation algorithm for the prize-collecting connected dominating set problem
Optimization Letters | 2025-11-26 | Paper |
A new approximation algorithm for minimum-weight (1,m)-connected dominating set
INFORMS Journal on Computing | 2025-11-19 | Paper |
| Minimum power partial cover with fairness constraint | 2025-10-29 | Paper |
Global approximation of local optimality: nonsubmodular optimization
Journal of the Operations Research Society of China | 2025-09-03 | Paper |
A 1/2-approximation algorithm for maximum interval multi-cover
Theoretical Computer Science | 2025-07-21 | Paper |
Approximation algorithms for the total dominating set problem
Journal of Combinatorial Optimization | 2025-07-18 | Paper |
Approximation algorithm for prize-collecting weighted set cover with fairness constraints
Discrete Applied Mathematics | 2025-06-30 | Paper |
Approximation algorithm for min sweep-period sweep cover with distance constraint
Discrete Mathematics, Algorithms and Applications | 2025-05-15 | Paper |
Exploring two new iterative methods for solving absolute value equations
Journal of Applied Mathematics and Computing | 2025-05-06 | Paper |
Approximation algorithm for the minimum interval partial multi-cover problem
Networks | 2025-03-14 | Paper |
Active fault diagnosis for LPV systems based on constrained zonotopes
IEEE Transactions on Automatic Control | 2025-01-21 | Paper |
Approximation algorithm for prize-collecting vertex cover with fairness constraints
Journal of Combinatorial Optimization | 2024-12-03 | Paper |
Adaptive influence maximization: adaptability via nonadaptability
INFORMS Journal on Computing | 2024-11-20 | Paper |
Approximation algorithm and FPT algorithm for connected-\(k\)-subgraph cover on minor-free graphs
Mathematical Structures in Computer Science | 2024-10-16 | Paper |
Evolutionary algorithm on general cover with theoretically guaranteed approximation ratio
INFORMS Journal on Computing | 2024-07-29 | Paper |
Approximation algorithms for maximum weighted target cover problem with distance limitations
Journal of Combinatorial Optimization | 2024-07-11 | Paper |
Approximation algorithm for the minimum partial connected Roman dominating set problem
Journal of Combinatorial Optimization | 2024-07-11 | Paper |
A unified approach to approximate partial, prize-collecting, and budgeted sweep cover problems
Optimization Letters | 2024-03-11 | Paper |
Approximation algorithms for the minimum power partial cover problem
Algorithmic Aspects in Information and Management | 2024-02-23 | Paper |
An approximation algorithm for the dynamic \(k\)-level facility location problem
Algorithmic Aspects in Information and Management | 2024-02-23 | Paper |
Approximation algorithm for (connected) Italian dominating function
Discrete Applied Mathematics | 2023-11-13 | Paper |
A Computational Approach to Optimal Control Problems with Almost Smooth Controls
Asia-Pacific Journal of Operational Research | 2023-10-19 | Paper |
A bicriteria approximation algorithm for minimum submodular cost partial multi-cover problem
Algorithmic Aspects in Information and Management | 2023-10-16 | Paper |
Computing connected-k-subgraph cover with connectivity requirement
Lecture Notes in Computer Science | 2023-08-04 | Paper |
An Analytic Model for Cluster-Based Wireless Sensor Networks
INFOR: Information Systems and Operational Research | 2023-05-09 | Paper |
Construction of minimum edge-fault tolerant connected dominating set in a general graph
Journal of Combinatorial Optimization | 2023-04-14 | Paper |
Constant approximation for the lifetime scheduling problem of \(p\)-percent coverage
INFORMS Journal on Computing | 2022-12-01 | Paper |
Partial inverse maximum spanning tree problem under the Chebyshev norm
Journal of Combinatorial Optimization | 2022-10-31 | Paper |
Nearly tight approximation algorithm for (connected) Roman dominating set
Optimization Letters | 2022-10-11 | Paper |
A primal-dual algorithm for the minimum power partial cover problem
Journal of Combinatorial Optimization | 2022-10-04 | Paper |
The price of fairness for a two-agent scheduling game minimizing total completion time
Journal of Combinatorial Optimization | 2022-10-04 | Paper |
Parallel algorithms for minimum general partial dominating set and maximum budgeted dominating set in unit disk graph
Theoretical Computer Science | 2022-09-14 | Paper |
Approximation algorithm for prize-collecting sweep cover with base stations
Theoretical Computer Science | 2022-08-25 | Paper |
Algorithms for covering multiple submodular constraints and applications
Journal of Combinatorial Optimization | 2022-08-19 | Paper |
| Constant-approximation for prize-collecting min-sensor sweep coverage with base stations | 2022-07-01 | Paper |
| Capacitated partial inverse maximum spanning tree under the weighted \(l_{\infty }\)-norm | 2022-06-29 | Paper |
| Parallel algorithm for minimum partial dominating set in unit disk graph | 2022-06-29 | Paper |
A Role of Minimum Spanning Tree
Nonlinear Combinatorial Optimization | 2022-06-10 | Paper |
Discrete Newton Method
Nonlinear Combinatorial Optimization | 2022-06-10 | Paper |
Nonsubmodular Optimization
Nonlinear Combinatorial Optimization | 2022-06-10 | Paper |
A distributed algorithm for a set cover game
Discrete Mathematics, Algorithms and Applications | 2022-06-10 | Paper |
| scientific article; zbMATH DE number 7491960 (Why is no real title available?) | 2022-03-17 | Paper |
Approximation algorithm for minimum partial multi-cover under a geometric setting
Optimization Letters | 2022-03-15 | Paper |
Probabilistic algorithm for minimum \(k\)-fold dominating set problem
SCIENTIA SINICA Mathematica | 2021-12-17 | Paper |
An asymptotically tight online algorithm for \(m\)-steiner traveling salesman problem
Information Processing Letters | 2021-12-14 | Paper |
Parallel approximation for partial set cover
Applied Mathematics and Computation | 2021-11-11 | Paper |
Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks
Journal of Global Optimization | 2021-08-17 | Paper |
| Improved Parallel Algorithm for Minimum Cost Submodular Cover Problem | 2021-08-09 | Paper |
Breaking the<i>r</i><sub>max</sub>Barrier: Enhanced Approximation Algorithms for Partial Set Multicover Problem
INFORMS Journal on Computing | 2021-06-23 | Paper |
Minimum power partial multi-cover on a line
Theoretical Computer Science | 2021-04-08 | Paper |
Data mule scheduling on a path with handling time and time span constraints
Optimization Letters | 2021-02-17 | Paper |
Approximation algorithms for the dynamic \(k\)-level facility location problems
Theoretical Computer Science | 2021-01-25 | Paper |
Computing Minimum <i>k</i>-Connected <i>m</i>-Fold Dominating Set in General Graphs
INFORMS Journal on Computing | 2020-11-09 | Paper |
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-09 | Paper |
Approximation algorithm for minimum connected 3-path vertex cover
Discrete Applied Mathematics | 2020-10-14 | Paper |
Optimal coverage in wireless sensor networks
Springer Optimization and Its Applications | 2020-09-03 | Paper |
Approximation algorithm for minimum weight connected-\(k\)-subgraph cover
Theoretical Computer Science | 2020-09-01 | Paper |
A game theoretic approach for minimal connected dominating set
Theoretical Computer Science | 2020-08-25 | Paper |
Approximation algorithm for (connected) bounded-degree deletion problem on unit disk graphs
Theoretical Computer Science | 2020-08-25 | Paper |
| Improved approximation algorithm for minimum weight \(k\)-subgraph cover problem | 2020-05-13 | Paper |
Approximation algorithms for capacitated partial inverse maximum spanning tree problem
Journal of Global Optimization | 2020-05-04 | Paper |
A primal-dual algorithm for the minimum partial set multi-cover problem
Journal of Combinatorial Optimization | 2020-03-24 | Paper |
Algorithm for online 3-path vertex cover
Theory of Computing Systems | 2020-02-27 | Paper |
Approximation algorithm for a generalized Roman domination problem in unit ball graphs
Journal of Combinatorial Optimization | 2020-02-03 | Paper |
A bicriteria algorithm for the minimum submodular cost partial set multi-cover problem
Theoretical Computer Science | 2019-12-27 | Paper |
Online hole healing for sensor coverage
Journal of Global Optimization | 2019-12-03 | Paper |
Approximation algorithm for the partial set multi-cover problem
Journal of Global Optimization | 2019-12-03 | Paper |
Approximation algorithms for minimum weight connected 3-path vertex cover
Applied Mathematics and Computation | 2019-11-26 | Paper |
| Primal dual algorithm for partial set multi-cover | 2019-10-11 | Paper |
Set function optimization
Journal of the Operations Research Society of China | 2019-07-19 | Paper |
Approximation algorithms for distance constraint sweep coverage with base stations
Journal of Combinatorial Optimization | 2019-06-25 | Paper |
Primal dual based algorithm for degree-balanced spanning tree problem
Applied Mathematics and Computation | 2019-04-29 | Paper |
| Extremality and Sharp Bounds for the k-edge-connectivity of Graphs | 2019-01-18 | Paper |
A simpler PTAS for connected k-path vertex cover in homogeneous wireless sensor network
Journal of Combinatorial Optimization | 2018-07-26 | Paper |
Performability Analysis of Large-Scale Multi-State Computing Systems
IEEE Transactions on Computers | 2018-06-27 | Paper |
Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming
Mathematical Programming. Series A. Series B | 2018-05-16 | Paper |
What network topology can tell in election prediction
Discrete Mathematics, Algorithms and Applications | 2018-04-10 | Paper |
Partial inverse maximum spanning tree in which weight can only be decreased under l_p-norm
Journal of Global Optimization | 2018-03-13 | Paper |
Circumference of 3-connected cubic graphs
Journal of Combinatorial Theory. Series B | 2017-11-28 | Paper |
A simple approximation algorithm for minimum weight partial connected set cover
Journal of Combinatorial Optimization | 2017-11-16 | Paper |
Two algorithms for minimum 2-connected r-hop dominating set
Information Processing Letters | 2017-11-03 | Paper |
A kind of conditional fault tolerance of alternating group graphs
Information Processing Letters | 2017-11-03 | Paper |
iGreen: green scheduling for peak demand minimization
Journal of Global Optimization | 2017-11-02 | Paper |
Local ratio method on partial set multi-cover
Journal of Combinatorial Optimization | 2017-10-17 | Paper |
A PTAS for minimum weighted connected vertex cover \(P_3\) problem in 3-dimensional wireless sensor networks
Journal of Combinatorial Optimization | 2017-03-03 | Paper |
A novel approach for detecting multiple rumor sources in networks with partial observations
Journal of Combinatorial Optimization | 2017-03-03 | Paper |
Approximation algorithm for partial positive influence problem in social network
Journal of Combinatorial Optimization | 2017-02-22 | Paper |
Solution of Bharathi-Kempe-Salek conjecture for influence maximization on arborescence
Journal of Combinatorial Optimization | 2017-02-22 | Paper |
PTAS for minimum \(k\)-path vertex cover in ball graph
Information Processing Letters | 2017-01-13 | Paper |
Approximation for minimum strongly connected dominating and absorbing set with routing-cost constraint in disk digraphs
Optimization Letters | 2016-10-27 | Paper |
Algorithms for the partial inverse matroid problem in which weights can only be increased
Journal of Global Optimization | 2016-09-15 | Paper |
The 0-1 inverse maximum independent set problem on forests and unicyclic graphs
Discrete Mathematics, Algorithms and Applications | 2016-07-08 | Paper |
Restricted connectivity of total digraph
Discrete Mathematics, Algorithms and Applications | 2016-07-08 | Paper |
Algorithm for constraint partial inverse matroid problem with weight increase forbidden
Theoretical Computer Science | 2016-07-05 | Paper |
