default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYishuo Shi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j18]Xiaoyan Lai, Yishuo Shi
:
Approximation algorithm of maximizing non-submodular functions under non-submodular constraint. Discret. Appl. Math. 361: 48-68 (2025)- 2024
- [j17]Yishuo Shi, Xiaoyan Lai:
Approximation algorithm of maximizing non-monotone non-submodular functions under knapsack constraint. Theor. Comput. Sci. 990: 114409 (2024) - [j16]Yishuo Shi, Hui Zhao:
Greedy algorithm for maximization of semi-monotone non-submodular functions with applications. Theor. Comput. Sci. 1013: 114755 (2024) - [j15]Yishuo Shi, Wen-Hsing Kuo, Chih-Wei Huang, Yen-Cheng Chou, Shih-Hau Fang, De-Nian Yang:
Cross-Layer Video Synthesizing and Antenna Allocation Scheme for Multi-View Video Provisioning Under Massive MIMO Networks. IEEE Trans. Mob. Comput. 23(1): 327-340 (2024) - [j14]Chih-Hang Wang, Yishuo Shi, De-Nian Yang, Wei-Yu Chen, Wen-Tsuen Chen:
Joint IoT Device Selection and Health-Aware Beamforming Design for MIMO-WPT. IEEE Trans. Mob. Comput. 23(9): 8822-8838 (2024) - [j13]Chih-Hang Wang, Yishuo Shi, De-Nian Yang, Chih-Yen Chen, Wanjiun Liao:
Optimizing Resource Allocation for Wireless VR Services. IEEE Trans. Serv. Comput. 17(5): 2719-2732 (2024) - 2022
- [j12]Jian-Jhih Kuo, Chih-Hang Wang, Yishuo Shi, De-Nian Yang, Wen-Tsuen Chen:
Scalable Rate Allocation for SDN With Diverse Service Requirements. IEEE Trans. Serv. Comput. 15(4): 2248-2260 (2022) - [c9]Ya-Wen Teng, Yishuo Shi, De-Nian Yang, Wang-Chien Lee, Philip S. Yu, Ying-Liang Lu, Ming-Syan Chen:
Epidemic Spread Optimization for Disease Containment with NPIs and Vaccination. ICDE 2022: 2845-2858 - 2021
- [c8]Ya-Wen Teng, Yishuo Shi, Chih-Hua Tai, De-Nian Yang, Wang-Chien Lee, Ming-Syan Chen:
Influence Maximization Based on Dynamic Personal Perception in Knowledge Graph. ICDE 2021: 1488-1499 - 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]Yubai Zhang, Zhao Zhang, Yishuo Shi, Xianyue Li:
Algorithm for Online 3-Path Vertex Cover. Theory Comput. Syst. 64(2): 327-338 (2020) - [j9]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) - [j8]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) - [c7]Yishuo Shi, Wen-Hsing Kuo, Chih-Wei Huang, Yen-Cheng Chou, Shih-Hau Fang, De-Nian Yang:
Cross-Layer Allocation Scheme for Multi-View Videos in Massive MIMO Networks. ICC 2020: 1-6 - [i5]Ya-Wen Teng, Yishuo Shi, Chih-Hua Tai, De-Nian Yang, Wang-Chien Lee, Ming-Syan Chen:
Influence Maximization Based on Dynamic Personal Perception in Knowledge Graph. CoRR abs/2010.07125 (2020)
2010 – 2019
- 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) - [c6]Ya-Wen Teng, Yishuo Shi, Jui-Yi Tsai, Hong-Han Shuai, Chih-Hua Tai, De-Nian Yang:
Optimizing Social-Topic Engagement on Social Network and Knowledge Graph. GLOBECOM 2019: 1-6 - [c5]Tung-Chun Chang, Yishuo Shi, De-Nian Yang, Wen-Tsuen Chen:
Seed Selection and Social Coupon Allocation for Redemption Maximization in Online Social Networks. ICDE 2019: 410-421 - [i4]Tung-Chun Chang, Yishuo Shi, De-Nian Yang, Wen-Tsuen Chen:
Seed Selection and Social Coupon Allocation for Redemption Maximization in Online Social Networks. CoRR abs/1902.07432 (2019) - 2018
- [j6]Xiaosong Li, Yishuo Shi, Xiaohui Huang:
PTAS for H-free node deletion problems in disk graphs. Discret. Appl. Math. 239: 119-124 (2018) - [c4]Yishuo Shi, Zhao Zhang, Ding-Zhu Du:
A Bicriteria Approximation Algorithm for Minimum Submodular Cost Partial Multi-Cover Problem. AAIM 2018: 62-73 - [c3]Yingli Ran, Yishuo Shi, Zhao Zhang:
Primal Dual Algorithm for Partial Set Multi-cover. COCOA 2018: 372-385 - [i3]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
- [j5]Zhao Zhang, Xiaoting Li, Yishuo Shi, Hongmei Nie, Yuqing Zhu:
PTAS for minimum k-path vertex cover in ball graph. Inf. Process. Lett. 119: 9-13 (2017) - [j4]Yingli Ran, Yishuo Shi, Zhao Zhang:
Local ratio method on partial set multi-cover. J. Comb. Optim. 34(1): 302-313 (2017) - [j3]Yishuo Shi, Zhao Zhang, Yuchang Mo, Ding-Zhu Du:
Approximation Algorithm for Minimum Weight Fault-Tolerant Virtual Backbone in Unit Disk Graphs. IEEE/ACM Trans. Netw. 25(2): 925-933 (2017) - [c2]Zhao Zhang, Yishuo Shi, James Willson, Ding-Zhu Du, Guangmo Tong:
Viral marketing with positive influence. INFOCOM 2017: 1-8 - [i2]Yishuo Shi, Zhao Zhang, Ding-Zhu Du:
Randomized Approximation Algorithm for Minimum Submodular Cost Partial Multi-Cover Problem. CoRR abs/1701.05339 (2017) - 2016
- [j2]Yishuo Shi, Yaping Zhang, Zhao Zhang, Weili Wu:
A greedy algorithm for the minimum 2-connected m-fold dominating set problem. J. Comb. Optim. 31(1): 136-151 (2016) - 2015
- [c1]Zhao Zhang, Yishuo Shi:
Approximation algorithm for minimum weight fault-tolerant virtual backbone in homogeneous wireless sensor network. INFOCOM 2015: 1080-1085 - [i1]Yishuo Shi, Zhao Zhang, Ding-Zhu Du:
Approximation Algorithm for Minimum Weight (k, m)-CDS Problem in Unit Disk Graph. CoRR abs/1508.05515 (2015) - 2014
- [j1]Yaping Zhang, Yishuo Shi, Zhao Zhang:
Approximation algorithm for the minimum weight connected k-subgraph cover problem. Theor. Comput. Sci. 535: 54-58 (2014)
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-12-10 20:46 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:
