StringologyTimes

Data Structures and Algorithms: 2018/9/29-31

1: Minimization of Gini impurity via connections with the k-means problem
2: On Minimizing the Completion Times of Long Flows over Inter-Datacenter WAN
3: On-line partitioning of width w posets into w^O(log log w) chains