On the max coloring problem
暂无分享,去创建一个
[1] Vangelis Th. Paschos,et al. On the max-weight edge coloring problem , 2010, J. Comb. Optim..
[2] R. Möhring. Algorithmic graph theory and perfect graphs , 1986 .
[3] Hadas Shachnai,et al. Batch Coloring Flat Graphs and Thin , 2008, SWAT.
[4] Vangelis Th. Paschos,et al. Weighted coloring on planar, bipartite and split graphs: Complexity and approximation , 2009, Discret. Appl. Math..
[5] J. G. Pierce,et al. Geometric Algorithms and Combinatorial Optimization , 2016 .
[6] N. S. Barnett,et al. Private communication , 1969 .
[7] Jun Qin,et al. Coloring interval graphs with first-fit , 1995, Discret. Math..
[8] Michael E. Saks,et al. An on-line graph coloring algorithm with sublinear performance ratio , 1989, Discret. Math..
[9] Marek Chrobak,et al. On Some Packing Problem Related to Dynamic Storage Allocation , 1988, RAIRO Theor. Informatics Appl..
[10] N. S. Narayanaswamy,et al. A Note on First-Fit Coloring of Interval Graphs , 2008, Order.
[11] Gerd Finke,et al. Batch processing with interval graph compatibilities between tasks , 2005, Discret. Appl. Math..
[12] Amos Fiat,et al. An improved algorithm for online coloring of intervals with bandwidth , 2006, Theor. Comput. Sci..
[13] Rajiv Raman,et al. Approximating interval coloring and max-coloring in chordal graphs , 2004, JEAL.
[14] Rajiv Raman,et al. Approximation Algorithms for the Max-coloring Problem , 2005, ICALP.
[15] Andrea Vitaletti,et al. Randomized Lower Bounds for Online Path Coloring , 1998, RANDOM.
[16] M. Golummc. Algorithmic graph theory and perfect graphs , 1980 .
[17] Thomas Erlebach,et al. Online Coloring of Intervals with Bandwidth , 2003, WAOA.
[18] Kirill Kogan,et al. Nonpreemptive Scheduling of Optical Switches , 2007, IEEE Transactions on Communications.
[19] 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).
[20] Tim Nonner. Clique Clustering Yields a PTAS for max-Coloring Interval Graphs , 2011, ICALP.
[21] Xuding Zhu,et al. A Coloring Problem for Weighted Graphs , 1997, Inf. Process. Lett..
[22] J. A. Hoogeveen,et al. Scheduling a batching machine , 1998 .
[23] Rajiv Raman,et al. Buffer minimization using max-coloring , 2004, SODA '04.
[24] D. de Werra,et al. Time slot scheduling of compatible jobs , 2007, J. Sched..
[25] Alexander Schrijver,et al. Combinatorial optimization. Polyhedra and efficiency. , 2003 .
[26] Dominique de Werra,et al. Chromatic Scheduling , 2007 .
[27] Leah Epstein,et al. Online Interval Coloring and Variants , 2005, ICALP.
[28] Ioannis Milis,et al. Improved approximation algorithms for the Max Edge-Coloring problem , 2011, Inf. Process. Lett..
[29] Vangelis Th. Paschos,et al. Weighted Coloring: further complexity and approximability results , 2006, Inf. Process. Lett..
[30] H. A. Kierstead,et al. The Linearity of First-Fit Coloring of Interval Graphs , 1988, SIAM J. Discret. Math..
[31] D. de Werra,et al. Graph Coloring Problems , 2013 .
[32] R. Govindarajan,et al. Buffer allocation in regular dataflow networks: an approach based on coloring circular-arc graphs , 1996, Proceedings of 3rd International Conference on High Performance Computing (HiPC).
[33] Telikepalli Kavitha,et al. Max-coloring paths: tight bounds and extensions , 2012, J. Comb. Optim..
[34] Vangelis Th. Paschos,et al. Approximating the max-edge-coloring problem , 2010, Theor. Comput. Sci..
[35] András Gyárfás,et al. On-line and first fit colorings of graphs , 1988, J. Graph Theory.
[36] Asaf Levin,et al. Approximation algorithm for minimizing total latency in machine scheduling with deliveries , 2008, Discret. Optim..
[37] Tommy R. Jensen,et al. Graph Coloring Problems , 1994 .