Yishui Wang

According to our database1, Yishui Wang authored at least 25 papers between 2015 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Approximation Algorithms for Robust Clustering Problems Using Local Search Techniques.
Proceedings of the Theory and Applications of Models of Computation, 2024

2023
Stochastic greedy algorithms for maximizing constrained submodular + supermodular functions.
Concurr. Comput. Pract. Exp., 2023

2022
Maximizing a monotone non-submodular function under a knapsack constraint.
J. Comb. Optim., 2022

An approximation algorithm for the spherical k-means problem with outliers by local search.
J. Comb. Optim., 2022

Approximation algorithms for two variants of correlation clustering problem.
J. Comb. Optim., 2022

2021
Approximation algorithms for spherical <i>k</i>-means problem using local search scheme.
Theor. Comput. Sci., 2021

Streaming algorithms for robust submodular maximization.
Discret. Appl. Math., 2021

Streaming Algorithms for Maximizing Monotone DR-Submodular Functions with a Cardinality Constraint on the Integer Lattice.
Asia Pac. J. Oper. Res., 2021

2020
Streaming algorithm for maximizing a monotone non-submodular function under d-knapsack constraint.
Optim. Lett., 2020

Non-submodular maximization on massive data streams.
J. Glob. Optim., 2020

Outliers Detection Is Not So Hard: Approximation Algorithms for Robust Clustering Problems Using Local Search Techniques.
CoRR, 2020

Local Search Algorithm for the Spherical k-Means Problem with Outliers.
Proceedings of the Algorithmic Aspects in Information and Management, 2020

2019
Local search approximation algorithms for the sum of squares facility location problems.
J. Glob. Optim., 2019

Approximation algorithm for squared metric two-stage stochastic facility location problem.
J. Comb. Optim., 2019

Approximating Robust Parameterized Submodular Function Maximization in Large-Scales.
Asia Pac. J. Oper. Res., 2019

Stochastic Greedy Algorithm Is Still Good: Maximizing Submodular + Supermodular Functions.
Proceedings of the Optimization of Complex Systems: Theory, 2019

Greedy Algorithm for Maximization of Non-submodular Functions Subject to Knapsack Constraint.
Proceedings of the Computing and Combinatorics - 25th International Conference, 2019

The Seeding Algorithm for Functional k-Means Problem.
Proceedings of the Computing and Combinatorics - 25th International Conference, 2019

Local Search Approximation Algorithms for the Spherical k-Means Problem.
Proceedings of the Algorithmic Aspects in Information and Management, 2019

Approximation Algorithm for the Correlation Clustering Problem with Non-uniform Hard Constrained Cluster Sizes.
Proceedings of the Algorithmic Aspects in Information and Management, 2019

2018
Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming.
Math. Program., 2018

A local search approximation algorithm for a squared metric k-facility location problem.
J. Comb. Optim., 2018

An approximation algorithm for k-facility location problem with linear penalties using local search scheme.
J. Comb. Optim., 2018

2017
An approximation algorithm for the nth power metric facility location problem with linear penalties.
Optim. Lett., 2017

2015
Local Search Algorithms for k-Median and k-Facility Location Problems with Linear Penalties.
Proceedings of the Combinatorial Optimization and Applications, 2015


  Loading...