On-line randomized call control revisited
暂无分享,去创建一个
Alberto Marchetti-Spaccamela | Adi Rosén | Alessio Presciutti | Stefano Leonardi | S. Leonardi | A. Marchetti-Spaccamela | A. Rosén | A. Presciutti
[1] Mihalis Yannakakis,et al. Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees, with Applications to Matching and Set Cover , 1993, ICALP.
[2] Robert E. Tarjan,et al. Amortized efficiency of list update and paging rules , 1985, CACM.
[3] Amos Fiat,et al. On-line Competive Algorithms for Call Admission in Optical Networks , 1996, ESA.
[4] Allan Borodin,et al. On the power of randomization in online algorithms , 1990, STOC '90.
[5] Prabhakar Raghavan,et al. Probabilistic construction of deterministic algorithms: Approximating packing integer programs , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[6] Ronitt Rubinfeld,et al. Short paths in expander graphs , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[7] Michael Luby,et al. A simple parallel algorithm for the maximal independent set problem , 1985, STOC '85.
[8] Yossi Azar,et al. Throughput-competitive on-line routing , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.
[9] Amos Fiat,et al. On-line load balancing with applications to machine scheduling and virtual circuit routing , 1993, STOC.
[10] Allan Borodin,et al. Online computation and competitive analysis , 1998 .
[11] Jon M. Kleinberg,et al. Approximation algorithms for disjoint paths problems , 1996 .
[12] Colin McDiarmid,et al. Surveys in Combinatorics, 1989: On the method of bounded differences , 1989 .
[13] Éva Tardos,et al. Disjoint paths in densely embedded graphs , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[14] Amos Fiat,et al. Competitive non-preemptive call control , 1994, SODA '94.
[15] Amos Fiat,et al. Lower bounds for on-line graph problems with application to on-line circuit and optical routing , 1996, STOC '96.
[16] Alberto Marchetti-Spaccamela,et al. On-line Resource Management with Applications to Routing and Scheduling , 1995, ICALP.
[17] 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.
[18] Stefano Leonardi,et al. On-Line Routing in All-Optical Networks , 1997, ICALP.
[19] Venkatesan Guruswami,et al. Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems , 1999, STOC '99.