3 citations · 4 across the 9 of their papers we have counts for
5 papers · 1 filter
Online Correlation Clustering: Simultaneously Optimizing All -norms
Sami Davies, Benjamin Moseley, Heather Newman
The -norm objectives for correlation clustering present a fundamental trade-off between minimizing total disagreements (the -norm) and ensuring fairness to individu…
Efficiently Coloring the Intersection of a General Matroid and Combinatorial Matroids
Stephen Arndt, Benjamin Moseley, Kirk Pruhs +1
This paper shows a polynomial-time algorithm that, given a general matroid and partition matroids , produces a coloring of the intersection $M = \cap…
Competitive Online Transportation Simplified
Stephen Arndt, Benjamin Moseley, Kirk Pruhs +1
The setting for the online transportation problem is a metric space , populated by parking garages of varying capacities. Over time cars arrive in , and must be irrevocab…
Robust Gittins for Stochastic Scheduling
Benjamin Moseley, Heather Newman, Kirk Pruhs +1
A common theme in stochastic optimization problems is that, theoretically, stochastic algorithms need to "know" relatively rich information about the underlying distributions. This…
Efficient Algorithms for Cardinality Estimation and Conjunctive Query Evaluation With Simple Degree Constraints
Sungjin Im, Benjamin Moseley, Hung Q. Ngo +1
Cardinality estimation and conjunctive query evaluation are two of the most fundamental problems in database query processing. Recent work proposed, studied, and implemented a robu…