research
∙
08/20/2023
Higher-Order Cheeger Inequality for Partitioning with Buffers
We prove a new generalization of the higher-order Cheeger inequality for...
share
research
∙
08/16/2023
Approximation Algorithms for Norm Multiway Cut
We consider variants of the classic Multiway Cut problem. Multiway Cut a...
research
∙
04/18/2023
Random Cuts are Optimal for Explainable k-Medians
We show that the RandomCoordinateCut algorithm gives the optimal competi...
research
∙
11/11/2022
Fair Curing and Network Design in SIS Epidemic Processes
This paper studies efficient algorithms for dynamic curing policies and ...
research
∙
11/07/2022
Optimal Scoring Rules for Multi-dimensional Effort
This paper develops a framework for the design of scoring rules to optim...
research
∙
09/07/2022
Algorithmic Learning Foundations for Common Law
This paper looks at a common law legal system as a learning algorithm, m...
research
∙
11/04/2021
Explainable k-means. Don't be greedy, plant bigger trees!
We provide a new bi-criteria Õ(log^2 k) competitive algorithm for explai...
research
∙
07/02/2021
Near-optimal Algorithms for Explainable k-Medians and k-Means
We consider the problem of explainable k-medians and k-means introduced ...
research
∙
10/27/2020
Improved Guarantees for k-means++ and k-means++ Parallel
In this paper, we study k-means++ and k-means++ parallel, the two most p...
research
∙
07/06/2020
Optimization of Scoring Rules
This paper introduces an objective for optimizing proper scoring rules. ...
research
∙
09/04/2019
Stochastic Linear Optimization with Adversarial Corruption
We extend the model of stochastic bandits with adversarial corruption (L...
research
∙
04/18/2018
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...
research
∙
03/02/2018
Independence number and the number of maximum independent sets in pseudofractal scale-free web and Sierpiński gasket
As a fundamental subject of theoretical computer science, the maximum in...
research
∙
02/07/2018
