Minimum Color Sum of Bipartite Graphs

Journal of Algorithms

Volumn 28, Issue 2, 1998, Pages 339-365

  Bar Noy, Amotz ^a   Kortsarz, Guy ^b  

^a TEL AVIV UNIVERSITY   (Israel)

^b OPEN UNIVERSITY OF ISRAEL   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000955229     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1998.0938     Document Type: Article

References (24)

1. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy, Proof verification and intractability of approximation problems, in "Proc. of the 33rd IEEE Symp. Foundations Computer Science," pp. 14-23, 1992.
2. B. Awerbuch and M. Saks, A dining philosophers algorithm with polynomial response time, in "Proc. 31st IEEE Symp. Foundation Computer Science," pp. 65-74, 1990.
3. J. Bar-Ilan and D. Peleg, Distributed resource allocation algorithms, in "Proc. Sixth International Workshop Distributed Algorithms," pp. 276-291, 1992.
4. 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 (1998), 183-202.
5. P. Berman and M. Fur̈er, Approximating maximum independent set in bounded degree graphs, in "Proc. Fifth ACM-SIAM Symp. Discrete Algorithms," pp. 365-371, 1994.
6. A. Blum, P. Chalasani, D. Coppersmith, B. Pulleyblank, P. Raghavan, and M. Sudan. The minimum latency problem, in "Proc. 26th IEEE Symp. Theory Computing," pp. 163-171, 1994.
7. K. Chandy and J. Misra, The drinking philosophers problems, ACM Trans. Programming Languages Syst. 6 (1984), 632-646.
8. N. Christofides, Worst case analysis of a new heuristic for the traveling salesman problem, Tech. Rep. GSIA, Carnegie-Mellon Univ., Pittsburgh, 1976.
9. P. Erdös, On the graph-theorem of Turán, Math. Lapok, 21 (1970), 249-251.
10. P. Erdös, E. Kubicka, and A. J. Schwenk, Graphs that require many colors to achieve their chromatic sum, Congr. Numer. 71 (1990), 17-28.
11. U. Feige and J. Kilian, Zero knowledge and the chromatic number, in "Proc. 11th IEEE Conf. Computational Theory," pp. 278-287, 1996.
12. G. Gallo, M. D. Grigoriadis, and R. E. Tarjan, A fast parametric maximum flow algorithm and applications, SIAM J. Comput. 18 (1989), 30-55.
13. 1-∈, in "Proc. 37th IEEE Symp. Foundation Computer Sci.," pp. 627-639, 1996.
14. D. S. Hochbaum, Efficient bounds for the stable set, vertex cover and set packing problems, Discrete Appl. Math. 6 (1983), 243-254.
15. M. M. Halldórsson and J. Radhakrishnan, Greed is good: Approximating independent sets in sparse and bounded-degree graphs, in "Proc. 26th IEEE Symp. Theory Computing," pp. 439-448, 1994.
16. E. Kubicka, "The Chromatic Sum of a Graph," Ph.D. Thesis, Western Michigan University, Kalamazoo, MI, 1989.
17. E. Kubicka, G. Kubicki, and D. Kountanis, Approximation algorithms for the chromatic sum, in "Proc. First Great Lakes Computer Sci. Conf.," Springer LNCS 507, pp. 15-21, 1989.
18. E. Kubicka and A. J. Schwenk, An introduction to chromatic sums, in "Proc. ACM Computer Sci. Conf.," pp. 39-45, 1989.
19. E. Lawler, "Combinatorial Optimization Networks and Matroids," Holt, Rinehart and Winston, New York, 1976.
20. N. Lynch, Upper bounds for static resource allocation in a distributed system, J. Comput. System Sci. 23 (1981), 254-278.
21. S. Nicoloso, M. Sarrafzadeh, and X. Song. On the sum coloring problem on interval graphs, unpublished manuscript.
22. C. H. Papadimitriou and M. Yannakakis, Optimization approximation and complexity classes, in "Proc. 20th IEEE Symp. Theory Computing, pp. 229-234, 1988.
23. P. Turán, An external problem in graph theory, Mat. Fiz Lapok 48 (1941), 436-452.
24. C. Thomassen, P. Erdös, Y. Alavi, J. Malde, and A. J. Schwenk, Tight bounds on the chromatic sum of a connected graph, J. Graph Theory 13 (1989), 353-357.