On the max-weight edge coloring problem-Reference-Cited by-同舟云学术

On the max-weight edge coloring problem

Published:2009-03-14 Issue:4 Volume:20 Page:429-442
ISSN:1382-6905
Container-title:Journal of Combinatorial Optimization
language:en
Short-container-title:J Comb Optim

Author:

Lucarelli Giorgio,Milis Ioannis,Paschos Vangelis T.

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications

Link

http://link.springer.com/content/pdf/10.1007/s10878-009-9223-z.pdf

Reference18 articles.

1. Afrati FN, Aslanidis T, Bampis E, Milis I (2005) Scheduling in switching networks with set-up delays. J Comb Optim 9:49–57

2. Bojarshinov VA (2001) Edge and total coloring of interval graphs. Discrete Appl Math 114:23–28

3. Brucker P, Gladky A, Hoogeveen H, Kovalyov M, Potts C, Tautenham T, van de Velde S (1998) Scheduling a batching machine. J Sched 1:31–54

4. Crescenzi P, Deng X, Papadimitriou ChH (2001) On approximating a scheduling problem. J Comb Optim 5:287–297

5. LNCS;D Werra de,2004

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

1. The Complexity of the Partition Coloring Problem;Lecture Notes in Computer Science;2020

2. The assignment problem with nearly Monge arrays and incompatible partner indices;Discrete Applied Mathematics;2016-10

3. On the max coloring problem;Theoretical Computer Science;2012-11

4. Improved approximation algorithms for the Max Edge-Coloring problem;Information Processing Letters;2011-08

5. Improved Approximation Algorithms for the Max-Edge Coloring Problem;Theory and Practice of Algorithms in (Computer) Systems;2011