Combining Online Algorithms for Acceptance and Rejection
暂无分享,去创建一个
[1] Yishay Mansour,et al. Improved combination of online algorithms for acceptance and rejection , 2004, SPAA '04.
[2] Yossi Azar,et al. On-line choice of on-line algorithms , 1993, SODA '93.
[3] Noga Alon,et al. Admission control to minimize rejections and online set cover with repetitions , 2005, SPAA '05.
[4] Ricardo A. Baeza-Yates,et al. Searching in the Plane , 1993, Inf. Comput..
[5] Yuval Rabani,et al. On-line admission control and circuit routing for high performance computing and communication , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[6] Amos Fiat,et al. Making commitments in the face of uncertainty: how to pick a winner almost every time (extended abstract) , 1996, STOC '96.
[7] Sundar Vishwanathan,et al. Competitive Algorithms for Layered Graph Traversal , 1998, SIAM J. Comput..
[8] Yossi Azar,et al. Combining online algorithms for rejection and acceptance , 2003, SPAA '03.
[9] Yossi Azar,et al. Beating the Logarithmic Lower Bound: Randomized Preemptive Disjoint Paths and Call Control Algorithms , 1999, SODA '99.
[10] Yossi Azar,et al. Throughput-competitive on-line routing , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.
[11] Yuval Rabani,et al. Competitive algorithms for layered graph traversal , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[12] Amos Fiat,et al. Competitive non-preemptive call control , 1994, SODA '94.