Improved Approximation Algorithms for the Max-Edge Coloring Problem

2011 ◽  
pp. 206-216
Author(s):  
Giorgio Lucarelli ◽  
Ioannis Milis
Keyword(s):  
Approximation Algorithms ◽  
Edge Coloring ◽  
Coloring Problem

scholarly journals On the max-weight edge coloring problem

2009 ◽  
Vol 20 (4) ◽  
pp. 429-442 ◽  
Author(s):  
Giorgio Lucarelli ◽  
Ioannis Milis ◽  
Vangelis T. Paschos
Keyword(s):  
Edge Coloring ◽  
Coloring Problem

On the Maximum Edge Coloring Problem

2009 ◽  
pp. 279-292 ◽  
Author(s):  
Giorgio Lucarelli ◽  
Ioannis Milis ◽  
Vangelis Th. Paschos
Keyword(s):  
Edge Coloring ◽  
Coloring Problem

A CHANNEL ASSIGNMENT PROBLEM IN MULTIHOP WIRELESS NETWORKS AND GRAPH THEORY

2004 ◽  
Vol 13 (02) ◽  
pp. 375-385 ◽  
Author(s):  
HIROSHI TAMURA ◽  
KAORU WATANABE ◽  
MASAKAZU SENGOKU ◽  
SHOJI SHINODA
Keyword(s):  
Wireless Networks ◽  
Graph Theory ◽  
Channel Assignment ◽  
Assignment Problem ◽  
Edge Coloring ◽  
Multihop Wireless Networks ◽  
Personal Communication ◽  
Multihop Wireless ◽  
Coloring Problem ◽  
Communication Devices

Multihop wireless networks consist of mobile terminals with personal communication devices. Each terminal can receive a message and then send it to another terminal. In these networks, it is important to assign channels for communications to each terminal efficiently. There are some studies on this assignment problem using a conventional edge coloring in graph theory. In this paper, we propose a new edge coloring problem in graph and network theory on this assignment problem and we discuss the computational complexity of the problem. This edge coloring problem takes the degree of interference into consideration. Therefore, we can reuse the channels more efficiently compared with the conventional method.

scholarly journals Approximation Algorithms for the Interval Constrained Coloring Problem

Algorithmica ◽  
2010 ◽  
Vol 61 (2) ◽  
pp. 342-361 ◽  
Author(s):  
Ernst Althaus ◽  
Stefan Canzar ◽  
Khaled Elbassioni ◽  
Andreas Karrenbauer ◽  
Julián Mestre
Keyword(s):  
Approximation Algorithms ◽  
Coloring Problem

On the edge-coloring problem for a class of 4-regular maps

1981 ◽  
Vol 5 (3) ◽  
pp. 269-275 ◽  
Author(s):  
F. Jaeger ◽  
H. Shank
Keyword(s):  
Edge Coloring ◽  
Coloring Problem ◽  
Regular Maps
Sign in / Sign up

Export Citation Format

Share Document