Sciweavers

CPC
2006
73views more  CPC 2006»
14 years 14 days ago
Feasible Schedules for Rotating Transmissions
Motivated by a scheduling problem that arises in the study of optical networks we prove the following result, which is a variation of a conjecture of Haxell, Wilfong and Winkler. ...
Noga Alon