New Results for the k-Secretary Problem
暂无分享,去创建一个
[1] Mohit Singh,et al. Secretary Problems via Linear Programming , 2010, IPCO.
[2] Nicole Immorlica,et al. A Knapsack Secretary Problem with Applications , 2007, APPROX-RANDOM.
[3] Fei Chen,et al. Revealing Optimal Thresholds for Generalized Secretary Problem via Continuous LP: Impacts on Online K-Item Auction and Bipartite K-Matching with Random Arrival Order , 2015, SODA.
[4] Andreas Tönnis,et al. Online Appointment Scheduling in the Random Order Model , 2015, ESA.
[5] P. Freeman. The Secretary Problem and its Extensions: A Review , 1983 .
[6] Ola Svensson,et al. A Framework for the Secretary Problem on the Intersection of Matroids , 2018, SODA.
[7] C. Kenyon. Best-fit bin-packing with random order , 1996, SODA '96.
[8] David Lindley,et al. Dynamic Programming and Decision Theory , 1961 .
[9] Martin Hoefer,et al. Combinatorial Secretary Problems with Ordinal Information , 2017, ICALP.
[10] Andreas Tönnis,et al. Submodular Secretary Problems: Cardinality, Matching, and Linear Constraints , 2016, APPROX-RANDOM.
[11] Nicole Immorlica,et al. Matroid Secretary Problems , 2018, J. ACM.
[12] Oded Lachish,et al. O(log log Rank) Competitive Ratio for the Matroid Secretary Problem , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.
[13] Berthold Vöcking,et al. Primal beats dual on online packing LPs in the random-order model , 2013, STOC.
[14] Zizhuo Wang,et al. A Dynamic Near-Optimal Algorithm for Online Linear Programming , 2009, Oper. Res..
[15] Susanne Albers,et al. Improved Online Algorithms for Knapsack and GAP in the Random Order Model , 2020, Algorithmica.
[16] Robert D. Kleinberg. A multiple-choice secretary algorithm with applications to online auctions , 2005, SODA '05.
[17] Thomas S. Ferguson,et al. Who Solved the Secretary Problem , 1989 .
[18] Ronald L. Graham,et al. Concrete mathematics - a foundation for computer science , 1991 .
[19] Nicole Immorlica,et al. Online auctions and generalized secretary problems , 2008, SECO.
[20] Mohammad Mahdian,et al. Online bipartite matching with random arrivals: an approach based on strongly factor-revealing LPs , 2011, STOC '11.
[21] Ola Svensson,et al. A Simple O(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem , 2015, SODA.
[22] Nicole Immorlica,et al. Matroids, secretary problems, and online mechanisms , 2007, SODA '07.
[23] Ronald L. Graham,et al. Concrete mathematics - a foundation for computer science (2. ed.) , 1994 .
[24] Nimrod Megiddo,et al. Improved algorithms and analysis for secretary problems and generalizations , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[25] Aranyak Mehta,et al. A 1.43-competitive online graph edge coloring algorithm in the random order arrival model , 2010, SODA '10.