Online edge coloring of paths and trees with a fixed number of colors
暂无分享,去创建一个
[1] Rajeev Motwani,et al. The Greedy Algorithm is Optimal for On-Line Edge Coloring , 1992, Inf. Process. Lett..
[2] Hal A. Kierstead,et al. Coloring Graphs On-line , 1996, Online Algorithms.
[3] Joan Boyar,et al. The relative worst order ratio applied to paging , 2005, SODA '05.
[4] Robert E. Tarjan,et al. Amortized efficiency of list update and paging rules , 1985, CACM.
[5] Lene M. Favrholdt,et al. Comparing First-Fit and Next-Fit for online edge coloring , 2010, Theor. Comput. Sci..
[6] Uriel Feige,et al. Approximating Maximum Edge Coloring in Multigraphs , 2002, APPROX.
[7] Joan Boyar,et al. The relative worst order ratio for online algorithms , 2007, TALG.
[8] Joan Boyar,et al. The Seat Reservation Problem , 1999, Algorithmica.
[9] Romeo Rizzi. Approximating the maximum 3-edge-colorable subgraph problem , 2009, Discret. Math..
[10] Zhi-Zhong Chen,et al. Approximating maximum edge 2-coloring in simple graphs , 2010, Discret. Appl. Math..
[11] Allan Borodin,et al. Online computation and competitive analysis , 1998 .
[12] Anna R. Karlin,et al. Competitive snoopy caching , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[13] Adrian Kosowski. Approximating the maximum 2- and 3-edge-colorable subgraph problems , 2009, Discret. Appl. Math..
[14] Andrew Chi-Chih Yao,et al. Probabilistic computations: Toward a unified measure of complexity , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).
[15] Tao Jiang,et al. Tight Bounds on the Competitive Ratio on Accommodating Sequences for the Seat Reservation Problem , 2003, J. Sched..
[16] Morten N. Nielsen,et al. On-Line Edge-Coloring with a Fixed Number of Colors , 2000, Algorithmica.
[17] Lukasz Kowalik,et al. Beyond the Vizing's Bound for at Most Seven Colors , 2014, SIAM J. Discret. Math..