Approximation results for the optimum cost chromatic partition problem
Author:
Publisher
Springer Berlin Heidelberg
Link
http://link.springer.com/content/pdf/10.1007/3-540-63165-8_226.pdf
Reference12 articles.
1. Bodlaender, H.L., Jansen, K., Woeginger, G.: Scheduling with incompatible jobs. Graph Theoretic Concepts in Computer Science, LNCS 657 (1992) 37–49
2. Chang, M.S., Chen, Y.H., Chang, G.J., Yan J.H.: Algorithmic aspects of the generalized clique-transversal problem on chordal graphs. Discrete Applied Mathematics 66 (1996) 189–203
3. Frank, A.: On chain and antichain families of a partially ordered set. Journal Combinatorial Theory (B) 29 (1980) 176–184
4. Gavril, F.: Algorithms for maximum k-colorings and k-coverings of transitive graphs. Networks 17 (1987) 465–470.
5. Golumbic, M.C.: Algorithmic graph theory and perfect graphs, Academic Press, New York (1980)
Cited by 5 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Optimal interval scheduling with nonidentical given machines;Cluster Computing;2019-01-28
2. On the Minimum Sum Coloring of P 4-Sparse Graphs;Graphs and Combinatorics;2012-11-28
3. Time slot scheduling of compatible jobs;Journal of Scheduling;2007-02-01
4. The Probabilistic Minimum Coloring Problem;Graph-Theoretic Concepts in Computer Science;2003
5. Approximation results for the optimum cost chromatic partition problem;Automata, Languages and Programming;1997
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3