default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYishui Wang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c9]Chenchen Wu, Rolf H. Möhring, Yishui Wang, Dachuan Xu, Dongmei Zhang:
Approximation Algorithms for Robust Clustering Problems Using Local Search Techniques. TAMC 2024: 197-208- 2023
- [j16]Sai Ji, Dachuan Xu
, Min Li, Yishui Wang, Dongmei Zhang:
Stochastic greedy algorithms for maximizing constrained submodular + supermodular functions. Concurr. Comput. Pract. Exp. 35(17) (2023) - 2022
- [j15]Sai Ji, Dachuan Xu, Min Li, Yishui Wang:
Approximation algorithms for two variants of correlation clustering problem. J. Comb. Optim. 43(5): 933-952 (2022) - [j14]Zhenning Zhang, Bin Liu, Yishui Wang, Dachuan Xu, Dongmei Zhang:
Maximizing a monotone non-submodular function under a knapsack constraint. J. Comb. Optim. 43(5): 1125-1148 (2022) - [j13]Yishui Wang, Chenchen Wu, Dongmei Zhang, Juan Zou:
An approximation algorithm for the spherical k-means problem with outliers by local search. J. Comb. Optim. 44(4): 2410-2422 (2022) - 2021
- [j12]Zhenning Zhang, Longkun Guo, Yishui Wang, Dachuan Xu, Dongmei Zhang:
Streaming Algorithms for Maximizing Monotone DR-Submodular Functions with a Cardinality Constraint on the Integer Lattice. Asia Pac. J. Oper. Res. 38(5): 2140004:1-2140004:14 (2021) - [j11]Ruiqi Yang, Dachuan Xu, Yukun Cheng, Yishui Wang, Dongmei Zhang:
Streaming algorithms for robust submodular maximization. Discret. Appl. Math. 290: 112-122 (2021) - [j10]Dongmei Zhang, Yukun Cheng, Min Li, Yishui Wang, Dachuan Xu:
Approximation algorithms for spherical k-means problem using local search scheme. Theor. Comput. Sci. 853: 65-77 (2021) - 2020
- [j9]Yijing Wang, Dachuan Xu, Yishui Wang, Dongmei Zhang:
Non-submodular maximization on massive data streams. J. Glob. Optim. 76(4): 729-743 (2020) - [j8]Yanjun Jiang, Yishui Wang, Dachuan Xu, Ruiqi Yang, Yong Zhang:
Streaming algorithm for maximizing a monotone non-submodular function under d-knapsack constraint. Optim. Lett. 14(5): 1235-1248 (2020) - [c8]Yishui Wang, Chenchen Wu, Dongmei Zhang, Juan Zou:
Local Search Algorithm for the Spherical k-Means Problem with Outliers. AAIM 2020: 141-148 - [i1]Yishui Wang, Rolf H. Möhring, Chenchen Wu, Dachuan Xu, Dongmei Zhang:
Outliers Detection Is Not So Hard: Approximation Algorithms for Robust Clustering Problems Using Local Search Techniques. CoRR abs/2012.10884 (2020)
2010 – 2019
- 2019
- [j7]Ruiqi Yang, Dachuan Xu, Yanjun Jiang, Yishui Wang, Dongmei Zhang:
Approximating Robust Parameterized Submodular Function Maximization in Large-Scales. Asia Pac. J. Oper. Res. 36(4): 1950022:1-1950022:24 (2019) - [j6]Jin Zhang, Min Li, Yishui Wang, Chenchen Wu, Dachuan Xu:
Approximation algorithm for squared metric two-stage stochastic facility location problem. J. Comb. Optim. 38(2): 618-634 (2019) - [j5]Dongmei Zhang, Dachuan Xu, Yishui Wang, Peng Zhang, Zhenning Zhang:
Local search approximation algorithms for the sum of squares facility location problems. J. Glob. Optim. 74(4): 909-932 (2019) - [c7]Sai Ji, Dachuan Xu, Min Li, Yishui Wang:
Approximation Algorithm for the Correlation Clustering Problem with Non-uniform Hard Constrained Cluster Sizes. AAIM 2019: 159-168 - [c6]Dongmei Zhang, Yukun Cheng, Min Li, Yishui Wang, Dachuan Xu:
Local Search Approximation Algorithms for the Spherical k-Means Problem. AAIM 2019: 341-351 - [c5]Min Li, Yishui Wang, Dachuan Xu, Dongmei Zhang:
The Seeding Algorithm for Functional k-Means Problem. COCOON 2019: 387-396 - [c4]Zhenning Zhang, Bin Liu, Yishui Wang, Dachuan Xu, Dongmei Zhang:
Greedy Algorithm for Maximization of Non-submodular Functions Subject to Knapsack Constraint. COCOON 2019: 651-662 - [c3]Sai Ji, Dachuan Xu, Min Li, Yishui Wang, Dongmei Zhang:
Stochastic Greedy Algorithm Is Still Good: Maximizing Submodular + Supermodular Functions. WCGO 2019: 488-497 - 2018
- [j4]Dongmei Zhang, Dachuan Xu, Yishui Wang, Peng Zhang, Zhenning Zhang:
A local search approximation algorithm for a squared metric k-facility location problem. J. Comb. Optim. 35(4): 1168-1184 (2018) - [j3]Yishui Wang, Dachuan Xu, Donglei Du, Chenchen Wu:
An approximation algorithm for k-facility location problem with linear penalties using local search scheme. J. Comb. Optim. 36(1): 264-279 (2018) - [j2]Chenchen Wu, Yishui Wang, Zaixin Lu, Panos M. Pardalos, Dachuan Xu, Zhao Zhang, Ding-Zhu Du:
Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming. Math. Program. 169(1): 255-275 (2018) - 2017
- [j1]Yishui Wang, Dachuan Xu, Donglei Du, Chenchen Wu:
An approximation algorithm for the nth power metric facility location problem with linear penalties. Optim. Lett. 11(5): 983-993 (2017) - [c2]Dongmei Zhang, Dachuan Xu, Yishui Wang, Peng Zhang, Zhenning Zhang:
A Local Search Approximation Algorithm for a Squared Metric k-Facility Location Problem. COCOA (1) 2017: 119-124 - 2015
- [c1]Yishui Wang, Dachuan Xu, Donglei Du, Chenchen Wu:
Local Search Algorithms for k-Median and k-Facility Location Problems with Linear Penalties. COCOA 2015: 60-71
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 2025-01-21 00:07 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:
