research
∙
07/17/2023
Resource Augmentation Analysis of the Greedy Algorithm for the Online Transportation Problem
We consider the online transportation problem set in a metric space cont...
share
research
∙
03/27/2023
Online k-Median with Consistent Clusters
We consider the online k-median clustering problem in which n points arr...
research
∙
11/15/2022
Optimizing Polymatroid Functions
We consider a class of optimization problems that involve determining th...
research
∙
06/26/2022
On the Impossibility of Decomposing Binary Matroids
We show that there exist k-colorable matroids that are not (b,c)-decompo...
research
∙
11/12/2021
A Competitive Algorithm for Throughout Maximization on Identical Machines
This paper considers the basic problem of scheduling jobs online with pr...
research
∙
07/25/2021
Relational Boosted Regression Trees
Many tasks use data housed in relational databases to train boosted regr...
research
∙
07/08/2021
An Efficient Reduction of a Gammoid to a Partition Matroid
Our main contribution is a polynomial-time algorithm to reduce a k-color...
research
∙
12/15/2020
Instance Optimal Join Size Estimation
We consider the problem of efficiently estimating the size of the inner ...
research
∙
08/01/2020
Relational Algorithms for k-means Clustering
The majority of learning tasks faced by data scientists involve relation...
research
∙
07/14/2020
Competitively Pricing Parking in a Tree
Motivated by demand-responsive parking pricing systems we consider poste...
research
∙
05/11/2020
A Relational Gradient Descent Algorithm For Support Vector Machine Training
We consider gradient descent like algorithms for Support Vector Machine ...
research
∙
03/24/2020
Approximate Aggregate Queries Under Additive Inequalities
We consider the problem of evaluating certain types of functional aggreg...
research
∙
01/19/2020
Dynamic Weighted Fairness with Minimal Disruptions
In this paper, we consider the following dynamic fair allocation problem...
research
∙
05/26/2019