research
∙
09/18/2022
Allocation Schemes in Analytic Evaluation: Applicant-Centric Holistic or Attribute-Centric Segmented?
Many applications such as hiring and university admissions involve evalu...
share
research
∙
07/16/2022
New and improved approximation algorithms for Steiner Tree Augmentation Problems
In the Steiner Tree Augmentation Problem (STAP), we are given a graph G ...
research
∙
05/09/2022
Informed Steiner Trees: Sampling and Pruning for Multi-Goal Path Finding in High Dimensions
We interleave sampling based motion planning methods with pruning ideas ...
research
∙
03/07/2022
Unit Perturbations in Budgeted Spanning Tree Problems
The minimum spanning tree of a graph is a well-studied structure that is...
research
∙
10/30/2021
On Small-Depth Tree Augmentations
We study the Weighted Tree Augmentation Problem for general link costs. ...
research
∙
06/02/2021
Using Predicted Weights for Ad Delivery
We study the performance of a proportional weights algorithm for online ...
research
∙
04/13/2021
A simple proof of the Moore-Hodgson Algorithm for minimizing the number of late jobs
The Moore-Hodgson Algorithm minimizes the number of late jobs on a singl...
research
∙
11/23/2020
Learnable and Instance-Robust Predictions for Online Matching, Flows and Load Balancing
This paper proposes a new model for augmenting algorithms with useful pr...
research
∙
11/11/2020
An Optimal Rounding for Half-Integral Weighted Minimum Strongly Connected Spanning Subgraph
In the weighted minimum strongly connected spanning subgraph (WMSCSS) pr...
research
∙
11/25/2019
Downgrading to Minimize Connectivity
We study the problem of interdicting a directed graph by deleting nodes ...
research
∙
06/10/2019
Stretching the Effectiveness of MLE from Accuracy to Bias for Pairwise Comparisons
A number of applications (e.g., AI bot tournaments, sports, peer grading...
research
∙
05/01/2019
Inventory Routing Problem with Facility Location
We study problems that integrate depot location decisions along with the...
research
∙
11/30/2018
A new system-wide diversity measure for recommendations with efficient algorithms
Recommender systems often operate on item catalogs clustered by genres, ...
research
∙
11/28/2018
Prepare for the Expected Worst: Algorithms for Reconfigurable Resources Under Uncertainty
In this paper we study how to optimally balance cheap inflexible resourc...
research
∙
12/14/2017