Yingli Ran

According to our database, Yingli Ran authored at least 35 papers between 2016 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Approximation algorithms for maximum weighted target cover problem with distance limitations.

Jianhong Jin, Yingli Ran, Zhao Zhang

J. Comb. Optim., May, 2024

Approximation Algorithm and FPT Algorithm for Connected-<i>k</i>-Subgraph Cover on Minor-Free Graphs.

Pengcheng Liu, Zhao Zhang, Yingli Ran, Xiaohui Huang

Math. Struct. Comput. Sci., 2024

Evolutionary Algorithm on General Cover with Theoretically Guaranteed Approximation Ratio.

Yaoyao Zhang, Chaojie Zhu, Shaojie Tang, Yingli Ran, Ding-Zhu Du, Zhao Zhang

INFORMS J. Comput., 2024

Sparse Graphic Degree Sequences Have Planar Realizations.

Amotz Bar-Noy, Toni Böhnlein, David Peleg, Yingli Ran, Dror Rawitz

Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

On Key Parameters Affecting the Realizability of Degree Sequences (Invited Paper).

Amotz Bar-Noy, Toni Böhnlein, David Peleg, Yingli Ran, Dror Rawitz

Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

Approximate Realizations for Outerplanaric Degree Sequences.

Amotz Bar-Noy, Toni Böhnlein, David Peleg, Yingli Ran, Dror Rawitz

Proceedings of the Combinatorial Algorithms - 35th International Workshop, 2024

Approximation Algorithm for the Maximum Interval Multi-cover Problem.

Yuxuan Xu, Yingli Ran, Zhao Zhang

Proceedings of the Algorithmic Aspects in Information and Management, 2024

2023

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

Jiao Zhou, Yingli Ran, Zhao Zhang, Shaojie Tang

CoRR, 2023

2022

Parallel algorithms for minimum general partial dominating set and maximum budgeted dominating set in unit disk graph.

Weizhi Hong, Yingli Ran, Zhao Zhang

Theor. Comput. Sci., 2022

Approximation algorithm for minimum partial multi-cover under a geometric setting.

Yingli Ran, Xiaohui Huang, Zhao Zhang, Ding-Zhu Du

Optim. Lett., 2022

Nearly tight approximation algorithm for (connected) Roman dominating set.

Ke Li, Yingli Ran, Zhao Zhang, Ding-Zhu Du

Optim. Lett., 2022

A primal-dual algorithm for the minimum power partial cover problem.

Menghong Li, Yingli Ran, Zhao Zhang

J. Comb. Optim., 2022

Approximation Algorithm for Minimum p Union Under a Geometric Setting.

Yingli Ran, Zhao Zhang

CoRR, 2022

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

Yingli Ran, Yaoyao Zhang, Zhao Zhang

CoRR, 2022

Performance Guaranteed Evolutionary Algorithm for Minimum Connected Dominating Set.

Chaojie Zhu, Yingli Ran, Zhao Zhang, Ding-Zhu Du

CoRR, 2022

Computing Connected-k-Subgraph Cover with Connectivity Requirement.

Pengcheng Liu, Zhao Zhang, Yingli Ran, Xiaohui Huang

Proceedings of the Theory and Applications of Models of Computation, 2022

Improved Parallel Algorithm for Minimum Cost Submodular Cover Problem.

Yingli Ran, Zhao Zhang, Shaojie Tang

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.

Yingli Ran, Xiaohui Huang, Zhao Zhang, Ding-Zhu Du

J. Glob. Optim., 2021

Breaking the <i>r</i>_max Barrier: Enhanced Approximation Algorithms for Partial Set Multicover Problem.

Yingli Ran, Zhao Zhang, Shaojie Tang, Ding-Zhu Du

INFORMS J. Comput., 2021

A Parallel Algorithm for Minimum Cost Submodular Cover.

Yingli Ran, Zhao Zhang

CoRR, 2021

Parallel approximation for partial set cover.

Yingli Ran, Ying Zhang, Zhao Zhang

Appl. Math. Comput., 2021

Parallel Algorithm for Minimum Partial Dominating Set in Unit Disk Graph.

Weizhi Hong, Zhao Zhang, Yingli Ran

Proceedings of the Combinatorial Optimization and Applications, 2021

2020

A bicriteria algorithm for the minimum submodular cost partial set multi-cover problem.

Yishuo Shi, Yingli Ran, Zhao Zhang, Ding-Zhu Du

Theor. Comput. Sci., 2020

Data mule scheduling on a path with handling time and time span constraints.

Zhihao Chen, Zhao Zhang, Yingli Ran, Yishuo Shi, Ding-Zhu Du

Optim. Lett., 2020

A primal-dual algorithm for the minimum partial set multi-cover problem.

Yingli Ran, Yishuo Shi, Changbing Tang, Zhao Zhang

J. Comb. Optim., 2020

2019

Approximation algorithm for the partial set multi-cover problem.

Yishuo Shi, Yingli Ran, Zhao Zhang, James Willson, Guangmo Tong, Ding-Zhu Du

J. Glob. Optim., 2019

Approximation algorithms for minimum weight connected 3-path vertex cover.

Yingli Ran, Zhao Zhang, Xiaohui Huang, Xiaosong Li, Ding-Zhu Du

Appl. Math. Comput., 2019

Approximation Algorithms for the Minimum Power Partial Cover Problem.

Menghong Li, Yingli Ran, Zhao Zhang

Proceedings of the Algorithmic Aspects in Information and Management, 2019

2018

Approximation algorithm for distance constraint sweep coverage without predetermined base stations.

Qingqing Chen, Xiaohui Huang, Yingli Ran

Discret. Math. Algorithms Appl., 2018

Primal dual based algorithm for degree-balanced spanning tree problem.

Yingli Ran, Zhihao Chen, Shaojie Tang, Zhao Zhang

Appl. Math. Comput., 2018

Primal Dual Algorithm for Partial Set Multi-cover.

Yingli Ran, Yishuo Shi, Zhao Zhang

Proceedings of the Combinatorial Optimization and Applications, 2018

2017

A simple approximation algorithm for minimum weight partial connected set cover.

Yubai Zhang, Yingli Ran, Zhao Zhang

J. Comb. Optim., 2017

Approximation algorithm for partial positive influence problem in social network.

Yingli Ran, Zhao Zhang, Hongwei Du, Yuqing Zhu

J. Comb. Optim., 2017

Local ratio method on partial set multi-cover.

Yingli Ran, Yishuo Shi, Zhao Zhang

J. Comb. Optim., 2017

2016

An approximation algorithm for maximum weight budgeted connected set cover.

Yingli Ran, Zhao Zhang, Ker-I Ko, Jun Liang

J. Comb. Optim., 2016