5 citations · 22 across the 14 of their papers we have counts for
16 papers
Maintaining Matroid Intersections Online
Niv Buchbinder, Anupam Gupta, Daniel Hathcock +2
Maintaining a maximum bipartite matching online while minimizing recourse/augmentations is a well studied problem, motivated by content delivery, job scheduling, and hashing. A bre…
Matroid Partition Property and the Secretary Problem
Dorna Abdolazimi, Anna R. Karlin, Nathan Klein +1
A matroid on a set of elements has the -partition property, for some , if it is possible to (randomly) construct a partition matroid on (a s…
An Improved Approximation Algorithm for the Minimum -Edge Connected Multi-Subgraph Problem
Anna R. Karlin, Nathan Klein, Shayan Oveis Gharan +1
We give a randomized -approximation algorithm for the minimum -edge connected spanning multi-subgraph problem, -ECSM.
Non-Adaptive Matroid Prophet Inequalities
Shuchi Chawla, Kira Goldner, Anna R. Karlin +1
We investigate non-adaptive algorithms for matroid prophet inequalities. Matroid prophet inequalities have been considered resolved since 2012 when [KW12] introduced thresholds tha…
Competition Alleviates Present Bias in Task Completion
Aditya Saraf, Anna R. Karlin, Jamie Morgenstern
We build upon recent work [Kleinberg and Oren, 2014, Kleinberg et al., 2016, 2017] that considers present biased agents, who place more weight on costs they must incur now than cos…
A (Slightly) Improved Approximation Algorithm for Metric TSP
Anna R. Karlin, Nathan Klein, Shayan Oveis Gharan
For some we give a randomized approximation algorithm for metric TSP.