Yingli Ran

According to our database1, Yingli Ran authored at least 28 papers between 2016 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Improved Approximation Algorithm for Minimum-Weight (1, m)-Connected Dominating Set.
CoRR, 2023

2022
Parallel algorithms for minimum general partial dominating set and maximum budgeted dominating set in unit disk graph.
Theor. Comput. Sci., 2022

Approximation algorithm for minimum partial multi-cover under a geometric setting.
Optim. Lett., 2022

Nearly tight approximation algorithm for (connected) Roman dominating set.
Optim. Lett., 2022

A primal-dual algorithm for the minimum power partial cover problem.
J. Comb. Optim., 2022

Approximation Algorithm for Minimum p Union Under a Geometric Setting.
CoRR, 2022

A parallel algorithm for minimum weight set cover with small neighborhood property.
CoRR, 2022

Performance Guaranteed Evolutionary Algorithm for Minimum Connected Dominating Set.
CoRR, 2022

Computing Connected-k-Subgraph Cover with Connectivity Requirement.
Proceedings of the Theory and Applications of Models of Computation, 2022

Improved Parallel Algorithm for Minimum Cost Submodular Cover Problem.
Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

2021
Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks.
J. Glob. Optim., 2021

Breaking the <i>r</i><sub>max</sub> Barrier: Enhanced Approximation Algorithms for Partial Set Multicover Problem.
INFORMS J. Comput., 2021

A Parallel Algorithm for Minimum Cost Submodular Cover.
CoRR, 2021

Parallel approximation for partial set cover.
Appl. Math. Comput., 2021

Parallel Algorithm for Minimum Partial Dominating Set in Unit Disk Graph.
Proceedings of the Combinatorial Optimization and Applications, 2021

2020
A bicriteria algorithm for the minimum submodular cost partial set multi-cover problem.
Theor. Comput. Sci., 2020

Data mule scheduling on a path with handling time and time span constraints.
Optim. Lett., 2020

A primal-dual algorithm for the minimum partial set multi-cover problem.
J. Comb. Optim., 2020

2019
Approximation algorithm for the partial set multi-cover problem.
J. Glob. Optim., 2019

Approximation algorithms for minimum weight connected 3-path vertex cover.
Appl. Math. Comput., 2019

Approximation Algorithms for the Minimum Power Partial Cover Problem.
Proceedings of the Algorithmic Aspects in Information and Management, 2019

2018
Approximation algorithm for distance constraint sweep coverage without predetermined base stations.
Discret. Math. Algorithms Appl., 2018

Primal dual based algorithm for degree-balanced spanning tree problem.
Appl. Math. Comput., 2018

Primal Dual Algorithm for Partial Set Multi-cover.
Proceedings of the Combinatorial Optimization and Applications, 2018

2017
A simple approximation algorithm for minimum weight partial connected set cover.
J. Comb. Optim., 2017

Approximation algorithm for partial positive influence problem in social network.
J. Comb. Optim., 2017

Local ratio method on partial set multi-cover.
J. Comb. Optim., 2017

2016
An approximation algorithm for maximum weight budgeted connected set cover.
J. Comb. Optim., 2016


  Loading...