Publisher
Institute for Operations Research and the Management Sciences (INFORMS)
Subject
Management Science and Operations Research,Computer Science Applications,General Mathematics
Reference16 articles.
1. Aggarwal G, Goel G, Karande C, Mehta A (2011) Online vertex-weighted bipartite matching and single-bid budgeted allocations.SODA '11: Proc. 22nd Annual ACM-SIAM Sympos. Discrete Algorithms(SIAM, Philadelphia), 1253–1264.
2. Bahmani B, Kapralov M (2010) Improved bounds for online stochastic matching.ESA '10: Proc. 22nd Annual Eur. Sympos. Algorithms(Springer-Verlag, Berlin, Heidelberg), 170–181.
3. Buchbinder N, Jain K, Naor S (2007) Online primal-dual algorithms for maximizing ad-auctions revenue.ESA '07: Proc. 15th Annual Eur. Sympos. Algorithms(Springer-Verlag, Berlin, Heidelberg), 253–264.
4. Devanur NR, Hayes TP (2009) The AdWords problem: Online keyword matching with budgeted bidders under random permutations.EC '09: Proc. 10th ACM Conf. Electronic Commerce(ACM, New York), 71–78.
5. Feldman J, Mehta A, Mirrokni VS, Muthukrishnan S (2009) Online stochastic matching: Beating 1 − 1/e.FOCS '09: Proc. 50th Annual IEEE Sympos. Foundations Comput. Sci.(IEEE, Washington, DC), 117–126.
Cited by
74 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献