71 citations · 130 across the 47 of their papers we have counts for
5 papers · 1 filter
Stochastic Minimum Vertex Cover in General Graphs: a -Approximation
Mahsa Derakhshan, Naveen Durvasula, Nika Haghtalab
Our main result is designing an algorithm that returns a vertex cover of with size at most times the expected size of the minimum vertex cover, using…
Structured Robust Submodular Maximization: Offline and Online Algorithms
Alfredo Torrico, Mohit Singh, Sebastian Pokutta +4
Constrained submodular function maximization has been used in subset selection problems such as selection of most informative sensor locations. While these models have been quite p…
Opting Into Optimal Matchings
Avrim Blum, Ioannis Caragiannis, Nika Haghtalab +3
We revisit the problem of designing optimal, individually rational matching mechanisms (in a general sense, allowing for cycles in directed graphs), where each player --- who is as…
-center Clustering under Perturbation Resilience
Maria-Florina Balcan, Nika Haghtalab, Colin White
The -center problem is a canonical and long-studied facility location and clustering problem with many applications in both its symmetric and asymmetric forms. Both versions of…
Ignorance is Almost Bliss: Near-Optimal Stochastic Matching With Few Queries
Avrim Blum, John P. Dickerson, Nika Haghtalab +3
The stochastic matching problem deals with finding a maximum matching in a graph whose edges are unknown but can be accessed via queries. This is a special case of stochastic -s…