default search action
Yingli Ran
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j22]Amotz Bar-Noy, Toni Böhnlein, David Peleg, Yingli Ran, Dror Rawitz:
Approximate realizations for outerplanaric degree sequences. J. Comput. Syst. Sci. 148: 103588 (2025) - 2024
- [j21]Yaoyao Zhang, Chaojie Zhu, Shaojie Tang
, Yingli Ran, Ding-Zhu Du
Evolutionary Algorithm on General Cover with Theoretically Guaranteed Approximation Ratio. INFORMS J. Comput. 36(2): 510-525 (2024) - [j20]Jianhong Jin, Yingli Ran, Zhao Zhang
Approximation algorithms for maximum weighted target cover problem with distance limitations. J. Comb. Optim. 47(4): 60 (2024) - [j19]Pengcheng Liu, Zhao Zhang
Approximation Algorithm and FPT Algorithm for Connected-k-Subgraph Cover on Minor-Free Graphs. Math. Struct. Comput. Sci. 34(3): 180-192 (2024) - [c9]Yuxuan Xu, Yingli Ran, Zhao Zhang:
Approximation Algorithm for the Maximum Interval Multi-cover Problem. AAIM (1) 2024: 28-34 - [c8]Amotz Bar-Noy, Toni Böhnlein, David Peleg, Yingli Ran, Dror Rawitz:
Approximate Realizations for Outerplanaric Degree Sequences. IWOCA 2024: 98-110 - [c7]Amotz Bar-Noy, Toni Böhnlein, David Peleg, Yingli Ran, Dror Rawitz:
On Key Parameters Affecting the Realizability of Degree Sequences (Invited Paper). MFCS 2024: 1:1-1:16 - [c6]Amotz Bar-Noy, Toni Böhnlein, David Peleg, Yingli Ran, Dror Rawitz:
Sparse Graphic Degree Sequences Have Planar Realizations. MFCS 2024: 18:1-18:17 - [i7]Amotz Bar-Noy, Toni Böhnlein, David Peleg, Yingli Ran, Dror Rawitz:
Approximate Realizations for Outerplanaric Degree Sequences. CoRR abs/2405.03278 (2024) - 2023
- [i6]Jiao Zhou, Yingli Ran, Zhao Zhang, Shaojie Tang:
Improved Approximation Algorithm for Minimum-Weight (1, m)-Connected Dominating Set. CoRR abs/2301.09247 (2023) - 2022
- [j18]Menghong Li, Yingli Ran, Zhao Zhang
A primal-dual algorithm for the minimum power partial cover problem. J. Comb. Optim. 44(3): 1913-1923 (2022) - [j17]Yingli Ran, Xiaohui Huang, Zhao Zhang, Ding-Zhu Du:
Approximation algorithm for minimum partial multi-cover under a geometric setting. Optim. Lett. 16(2): 667-680 (2022) - [j16]Ke Li, Yingli Ran, Zhao Zhang, Ding-Zhu Du:
Nearly tight approximation algorithm for (connected) Roman dominating set. Optim. Lett. 16(8): 2261-2276 (2022) - [j15]Weizhi Hong, Yingli Ran, Zhao Zhang:
Parallel algorithms for minimum general partial dominating set and maximum budgeted dominating set in unit disk graph. Theor. Comput. Sci. 932: 13-20 (2022) - [c5]Yingli Ran, Zhao Zhang, Shaojie Tang:
Improved Parallel Algorithm for Minimum Cost Submodular Cover Problem. COLT 2022: 3490-3502 - [c4]Pengcheng Liu, Zhao Zhang
Computing Connected-k-Subgraph Cover with Connectivity Requirement. TAMC 2022: 93-102 - [i5]Chaojie Zhu, Yingli Ran, Zhao Zhang, Ding-Zhu Du:
Performance Guaranteed Evolutionary Algorithm for Minimum Connected Dominating Set. CoRR abs/2201.05332 (2022) - [i4]Yingli Ran, Yaoyao Zhang, Zhao Zhang:
A parallel algorithm for minimum weight set cover with small neighborhood property. CoRR abs/2202.03872 (2022) - [i3]Yingli Ran, Zhao Zhang:
Approximation Algorithm for Minimum p Union Under a Geometric Setting. CoRR abs/2208.14264 (2022) - 2021
- [j14]Yingli Ran, Ying Zhang, Zhao Zhang:
Parallel approximation for partial set cover. Appl. Math. Comput. 408: 126358 (2021) - [j13]Yingli Ran, Zhao Zhang
Breaking the rmax Barrier: Enhanced Approximation Algorithms for Partial Set Multicover Problem. INFORMS J. Comput. 33(2): 774-784 (2021) - [j12]Yingli Ran, Xiaohui Huang, Zhao Zhang, Ding-Zhu Du:
Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks. J. Glob. Optim. 80(3): 661-677 (2021) - [c3]Weizhi Hong, Zhao Zhang, Yingli Ran:
Parallel Algorithm for Minimum Partial Dominating Set in Unit Disk Graph. COCOA 2021: 527-537 - [i2]Yingli Ran, Zhao Zhang:
A Parallel Algorithm for Minimum Cost Submodular Cover. CoRR abs/2108.04416 (2021) - 2020
- [j11]Yingli Ran, Yishuo Shi, Changbing Tang, Zhao Zhang
A primal-dual algorithm for the minimum partial set multi-cover problem. J. Comb. Optim. 39(3): 725-746 (2020) - [j10]Zhihao Chen, Zhao Zhang, Yingli Ran, Yishuo Shi, Ding-Zhu Du:
Data mule scheduling on a path with handling time and time span constraints. Optim. Lett. 14(7): 1701-1710 (2020) - [j9]Yishuo Shi, Yingli Ran, Zhao Zhang, Ding-Zhu Du:
A bicriteria algorithm for the minimum submodular cost partial set multi-cover problem. Theor. Comput. Sci. 803: 1-9 (2020)
2010 – 2019
- 2019
- [j8]Yingli Ran, Zhao Zhang
Approximation algorithms for minimum weight connected 3-path vertex cover. Appl. Math. Comput. 347: 723-733 (2019) - [j7]Yishuo Shi, Yingli Ran, Zhao Zhang, James Willson, Guangmo Tong, Ding-Zhu Du:
Approximation algorithm for the partial set multi-cover problem. J. Glob. Optim. 75(4): 1133-1146 (2019) - [c2]Menghong Li, Yingli Ran, Zhao Zhang:
Approximation Algorithms for the Minimum Power Partial Cover Problem. AAIM 2019: 179-191 - 2018
- [j6]Yingli Ran, Zhihao Chen, Shaojie Tang, Zhao Zhang
Primal dual based algorithm for degree-balanced spanning tree problem. Appl. Math. Comput. 316: 167-173 (2018) - [j5]Qingqing Chen, Xiaohui Huang, Yingli Ran:
Approximation algorithm for distance constraint sweep coverage without predetermined base stations. Discret. Math. Algorithms Appl. 10(5): 1850064:1-1850064:9 (2018) - [c1]Yingli Ran, Yishuo Shi, Zhao Zhang:
Primal Dual Algorithm for Partial Set Multi-cover. COCOA 2018: 372-385 - [i1]Yishuo Shi, Yingli Ran, Zhao Zhang, James Willson, Guangmo Tong, Ding-Zhu Du:
Approximation Algorithm for the Partial Set Multi-Cover Problem. CoRR abs/1811.08185 (2018) - 2017
- [j4]Yingli Ran, Zhao Zhang, Hongwei Du, Yuqing Zhu:
Approximation algorithm for partial positive influence problem in social network. J. Comb. Optim. 33(2): 791-802 (2017) - [j3]Yingli Ran, Yishuo Shi, Zhao Zhang:
Local ratio method on partial set multi-cover. J. Comb. Optim. 34(1): 302-313 (2017) - [j2]Yubai Zhang, Yingli Ran, Zhao Zhang
A simple approximation algorithm for minimum weight partial connected set cover. J. Comb. Optim. 34(3): 956-963 (2017) - 2016
- [j1]Yingli Ran, Zhao Zhang, Ker-I Ko, Jun Liang:
An approximation algorithm for maximum weight budgeted connected set cover. J. Comb. Optim. 31(4): 1505-1517 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-25 22:43 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: