Yingli Ran

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
Degree realization by bipartite cactus graphs
Journal of Graph Algorithms and Applications
2026-09-25Paper
Learn to optimize from structured samples for minimum partial set cover
Discrete Mathematics, Algorithms and Applications
2026-05-20Paper
On key parameters affecting the realizability of degree sequences (invited paper)2026-05-12Paper
Sparse graphic degree sequences have planar realizations2026-05-12Paper
A PTAS for the budgeted power maximum coverage problem
Theoretical Computer Science
2025-12-05Paper
A new approximation algorithm for minimum-weight (1,m)-connected dominating set
INFORMS Journal on Computing
2025-11-19Paper
Degree realization by bipartite cactus graphs2025-11-11Paper
A 1/2-approximation algorithm for maximum interval multi-cover
Theoretical Computer Science
2025-07-21Paper
Approximation algorithm for the minimum interval partial multi-cover problem
Networks
2025-03-14Paper
Approximate realizations for outerplanaric degree sequences2025-02-28Paper
Approximate realizations for outerplanaric degree sequences
Journal of Computer and System Sciences
2024-12-27Paper
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 algorithms for the minimum power partial cover problem
Algorithmic Aspects in Information and Management
2024-02-23Paper
Computing connected-k-subgraph cover with connectivity requirement
Lecture Notes in Computer Science
2023-08-04Paper
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
Parallel algorithms for minimum general partial dominating set and maximum budgeted dominating set in unit disk graph
Theoretical Computer Science
2022-09-14Paper
Parallel algorithm for minimum partial dominating set in unit disk graph2022-06-29Paper
Approximation algorithm for minimum partial multi-cover under a geometric setting
Optimization Letters
2022-03-15Paper
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
Data mule scheduling on a path with handling time and time span constraints
Optimization Letters
2021-02-17Paper
A primal-dual algorithm for the minimum partial set multi-cover problem
Journal of Combinatorial Optimization
2020-03-24Paper
A bicriteria algorithm for the minimum submodular cost partial set multi-cover problem
Theoretical Computer Science
2019-12-27Paper
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
Primal dual based algorithm for degree-balanced spanning tree problem
Applied Mathematics and Computation
2019-04-29Paper
Approximation algorithm for distance constraint sweep coverage without predetermined base stations
Discrete Mathematics, Algorithms and Applications
2018-11-14Paper
A simple approximation algorithm for minimum weight partial connected set cover
Journal of Combinatorial Optimization
2017-11-16Paper
Local ratio method on partial set multi-cover
Journal of Combinatorial Optimization
2017-10-17Paper
Approximation algorithm for partial positive influence problem in social network
Journal of Combinatorial Optimization
2017-02-22Paper
An approximation algorithm for maximum weight budgeted connected set cover
Journal of Combinatorial Optimization
2016-05-11Paper


Research outcomes over time


This page was built for person: Yingli Ran