Transport schemes for topology-transparent scheduling
From MaRDI portal
Publication:2471060
DOI10.1007/s10878-007-9058-4zbMath1146.90339MaRDI QIDQ2471060
Charles J. Colbourn, Violet R. Syrotiuk, Zhi-Qiang Zhang
Publication date: 18 February 2008
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-007-9058-4
90B06: Transportation, logistics and supply chain management
90B35: Deterministic scheduling theory in operations research
90B10: Deterministic network models in operations research
Uses Software
Cites Work
- Unnamed Item
- Families of finite sets in which no intersection of \(\ell\) sets is covered by the union of \(s\) others
- Families of finite sets in which no set is covered by the union of \(r\) others
- Orthogonal arrays. Theory and applications
- On the upper bound of the size of the \(r\)-cover-free families
- Cover-free families and topology-transparent scheduling for MANETs
- Some new bounds for cover-free families
- A five-phase reservation protocol (FPRP) for mobile ad hoc networks