-
Learnable and Instance-Robust Predictions for Online Matching, Flows and Load Balancing
This paper proposes a new model for augmenting algorithms with useful pr...
11/23/2020 ∙ by Thomas Lavastida, et al. ∙
7
∙
share
read it
-
An Optimal Rounding for Half-Integral Weighted Minimum Strongly Connected Spanning Subgraph
In the weighted minimum strongly connected spanning subgraph (WMSCSS) pr...
11/11/2020 ∙ by D. Ellis Hershkowitz, et al. ∙
0
∙
share
read it
-
Downgrading to Minimize Connectivity
We study the problem of interdicting a directed graph by deleting nodes ...
11/25/2019 ∙ by Hassene Aissi, et al. ∙
0
∙
share
read it
-
Stretching the Effectiveness of MLE from Accuracy to Bias for Pairwise Comparisons
A number of applications (e.g., AI bot tournaments, sports, peer grading...
06/10/2019 ∙ by Jingyan Wang, et al. ∙
0
∙
share
read it
-
Inventory Routing Problem with Facility Location
We study problems that integrate depot location decisions along with the...
05/01/2019 ∙ by Yang Jiao, et al. ∙
0
∙
share
read it
-
A new system-wide diversity measure for recommendations with efficient algorithms
Recommender systems often operate on item catalogs clustered by genres, ...
11/30/2018 ∙ by Arda Antikacioglu, et al. ∙
0
∙
share
read it
-
Prepare for the Expected Worst: Algorithms for Reconfigurable Resources Under Uncertainty
In this paper we study how to optimally balance cheap inflexible resourc...
11/28/2018 ∙ by D. Ellis Hershkowitz, et al. ∙
0
∙
share
read it
-
Approximation Algorithms for Replenishment Problems with Fixed Turnover Times
We introduce and study a class of optimization problems we coin replenis...
12/14/2017 ∙ by Thomas Bosman, et al. ∙
0
∙
share
read it
