
Nearoptimal Algorithms for Explainable kMedians and kMeans
We consider the problem of explainable kmedians and kmeans introduced ...
read it

Improved Guarantees for kmeans++ and kmeans++ Parallel
In this paper, we study kmeans++ and kmeans++ parallel, the two most p...
read it

Optimization of Scoring Rules
This paper introduces an objective for optimizing proper scoring rules. ...
read it

Stochastic Linear Optimization with Adversarial Corruption
We extend the model of stochastic bandits with adversarial corruption (L...
read it

Improving information centrality of a node in complex networks by adding edges
The problem of increasing the centrality of a network node arises in man...
read it

Independence number and the number of maximum independent sets in pseudofractal scalefree web and Sierpiński gasket
As a fundamental subject of theoretical computer science, the maximum in...
read it

Current Flow Group Closeness Centrality for Complex Networks
Current flow closeness centrality (CFCC) has a better discriminating abi...
read it
Liren Shan
is this you? claim profile