APPROXIMATION ALGORITHMS FOR DISTANCE-2 EDGE COLORING.
Lists
Only you see this
Abstract
The authors consider the link scheduling problem for packet radio networks which is assigning channels to the connecting links so that transmission may proceed on all links assigned the same channel simultaneously without collisions. This problem can be cast as the distance-2 edge coloring problem, a variant of proper edge coloring, on the graph with transceivers as vertices and links as edges. They present efficient approximation algorithms for the distance-2 edge coloring problem for various classes of graphs.
BibTeX
@inproceedings{barrett2002approximation,
author = {Christopher L. Barrett and Gabriel Istrate and Anil Kumar Vilikanti and Madhav Marathe and Shripad Thite},
title = {{APPROXIMATION ALGORITHMS FOR DISTANCE-2 EDGE COLORING.}},
booktitle = {University},
year = {2002},
}Loading related content...