Fetching the paper…
Reading the bibliography…
In this paper, we consider a new problem of portfolio optimization using stochastic information.
Comments on bases in dependence structures
Richard A Brualdi · 1969
Earlier work this paper cites.
An analysis of approximations for maximizing submodular set functions—i
George L Nemhauser, Laurence A Wolsey, and Marshall L Fisher · 1978
Earlier work this paper cites.
A threshold of ln n for approximating set cover
Uriel Feige · 1998
Earlier work this paper cites.
Segmentation problems
Jon Kleinberg, Christos Papadimitriou, and Prabhakar Raghavan · 2004
Earlier work this paper cites.
A note on concentration of submodular functions, 2010
Jan Vondrak · 2010
Earlier work this paper cites.
Submodular function maximization via the multilinear relaxation and contention resolution schemes
Chandra Chekuri, Jan Vondrák, and Rico Zenklusen · 2011
Earlier work this paper cites.
Submodular function maximization via the multilinear relaxation and contention resolution schemes
Jan Vondrák, Chandra Chekuri, and Rico Zenklusen · 2011
Earlier work this paper cites.
Learning sparse combinatorial representations via two-stage submodular maximization
Eric Balkanski, Baharan Mirzasoleiman, Andreas Krause, and Yaron Singer · 2016
Earlier work this paper cites.
Probabilistic submodular maximization in sub-linear time
Serban Stan, Morteza Zadimoghaddam, Andreas Krause, and Amin Karbasi · 2017
Cited alongside, same era.
Team performance with test scores
Jon Kleinberg and Maithra Raghu · 2018
Cited alongside, same era.
Combinatorial optimization under uncertainty: Probing and stopping-time algorithms
Sahil Singla · 2018
Cited alongside, same era.
Data-driven algorithm design, 2020
Maria-Florina Balcan · 2020
Cited alongside, same era.
The outer limits of contention resolution on matroids and connections to the secretary problem
Shaddin Dughmi · 2020
Cited alongside, same era.
Faster matchings via learned duals
Michael Dinitz, Sungjin Im, Thomas Lavastida, Benjamin Moseley, and Sergei Vassilvitskii · 2021
Cited alongside, same era.
Algorithms with predictions
Michael Mitzenmacher and Sergei Vassilvitskii · 2022
Later among the works it cites.
Submodular dominance and applications
Frederick Qiu and Sahil Singla · 2022
Later among the works it cites.
Predictive flows for faster ford-fulkerson
Sami Davies, Benjamin Moseley, Sergei Vassilvitskii, and Yuyan Wang · 2023
Later among the works it cites.
Swati Gupta, Jai Moondra, and Mohit Singh · 2023
Later among the works it cites.
Speeding up bellman ford via minimum violation permutations
Silvio Lattanzi, Ola Svensson, and Sergei Vassilvitskii · 2023
Later among the works it cites.
The madness of multiple entries in march madness, 2024
Jeff Decary, David Bergman, Carlos Cardonha, Jason Imbrogno, and Andrea Lodi · 2024
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Faster fundamental graph algorithms via learned predictions
Justin Chen, Sandeep Silwal, Ali Vakilian, and Fred Zhang · 2022
Cited alongside, same era.
Matroid secretary is equivalent to contention resolution
Shaddin Dughmi · 2022
Cited alongside, same era.
Closest in time.
Sami Davies, Sergei Vassilvitskii, and Yuyan Wang · 2024
Closest in time.