Sum Multi-coloring of Graphs-Reference-Cited by-同舟云学术

Sum Multi-coloring of Graphs

Published:1999 Issue: Volume: Page:390-401
ISSN:0302-9743
Container-title:Algorithms - ESA’ 99
language:
Short-container-title:

Author:

Bar-Noy Amotz,Halldórsson Magnús M.,Kortsarz Guy,Salman Ravit,Shanhnai Hadas

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-48481-7_34

Reference11 articles.

1. A. Bar-Noy, M. Bellare, M. M. Halldórsson, H. Shachnai, and T. Tamir. On chromatic sums and distributed resource allocation. Information and Computation, 140:183–202, 1998.

2. A. Bar-Noy, M. M. Halldórsson, G. Kortsarz, R. Salman and H. Shachnai. Sum Multi-Coloring of Graphs. TR #CS0949, Technion IIT, CS Dept., Nov. 1998. http://www.raunvis.hi.is/~mmh/Papers/smc.html

3. A. Bar-Noy and G. Kortsarz. The minimum color-sum of bipartite graphs. J. Algorithms, 28:339–365, 1998.

4. E. W. Dijkstra. Cooperating Sequential Processes, in Programming Languages, ed. by F. Genuys, Academic Press, 43–112, 1968.

5. U. Feige and J. Kilian. Zero Knowledge and the Chromatic number. J. Computer Sys. Sci., 57(2):187–199, Oct. 1998.

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Novel Unfeasible Space Exploring Matheuristic Proposal to Solve the Sum Coloring Problem;Advances in Computational Collective Intelligence;2022

2. Finding the chromatic sums of graphs using a D-Wave quantum computer;The Journal of Supercomputing;2019-02-02

3. On Minimizing Average Weighted Completion Time of Multiprocessor Tasks with Release Dates;Automata, Languages and Programming;2001

4. On Minimizing Average Weighted Completion Time: A PTAS for Scheduling General Multiprocessor Tasks;Fundamentals of Computation Theory;2001

5. Multicoloring Planar Graphs and Partial k-Trees;Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques;1999