Author:
Buchbinder Niv,Jain Kamal,Naor Joseph (Seffi)
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. Alon, N., Awerbuch, B., Azar, Y., Buchbinder, N., Naor, J.: The online set cover problem. In: Proceedings of the 35th STOC, pp. 100–105 (2003)
2. Andelman, N., Mansour, Y.: Auctions with budget constraints. In: Proc. of the 9th Scandinavian Workshop on Algorithm Theory, pp. 26–38 (2004)
3. Aspnes, J., Azar, Y., Fiat, A., Plotkin, S., Waarts, O.: On-line routing of virtual circuits with applications to load balancing and machine scheduling. J. ACM 44(3), 486–504 (1997)
4. Awerbuch, B., Azar, Y., Plotkin, S.: Throughput-competitive online routing. In: Proc. of the 34th Annual Symposium on Foundations of Computer Science, pp. 32–40 (1993)
5. Blum, A., Hartline, J.: Near-optimal online auctions (2005)
Cited by
81 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Online Matching with Stochastic Rewards: Advanced Analyses Using Configuration Linear Programs;Web and Internet Economics;2023-12-31
2. Optimizing Reconfigurable Optical Datacenters: The Power of Randomization;Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis;2023-11-11
3. Chasing Positive Bodies;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
4. Online Utilization Maximization in Resource Allocation with Minimum Service Guarantees;2023 19th International Conference on Network and Service Management (CNSM);2023-10-30
5. Online Proactive Multi-Task Assignment with Resource Availability Anticipation;Electronic Proceedings in Theoretical Computer Science;2023-09-30