On a packet scheduling problem for smart antennas and polyhedra defined by circular-ones matrices

DOI10.1016/J.ENDM.2004.03.035MaRDI QIDQ3439149zbMATH OpenOpenAlexFDO

Authors Dion Gijswijt

Publication date 29 May 2007

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2004.03.035

zbMATH Keywords

integer programmingpacket schedulingcyclic schedulingpolytime algorithm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Communication theory (94A05) Circuits, networks (94C99)

Recommendations

• Scheduling of a Smart Antenna: Capacitated Coloring of Unit Circular-Arc Graphs
• Integer Decomposition for Polyhedra Defined by Nearly Totally Unimodular Matrices
• Optimal packet-to-slot assignment in mobile telecommunications
• Polynomial algorithms for a two-class multiprocessor scheduling problem in mobile telecommunications systems
• A note on SS/TDMA satellite communication

Cites work

• scientific article; zbMATH DE number 2230231 (Why is no real title available?)
• An $O(n^2 )$ Algorithm for Coloring Proper Circular Arc Graphs

Cited in

(3)

• Integer Decomposition for Polyhedra Defined by Nearly Totally Unimodular Matrices
• Scheduling of a Smart Antenna: Capacitated Coloring of Unit Circular-Arc Graphs
• On spherical designs of some harmonic indices

This page was built for publication: On a packet scheduling problem for smart antennas and polyhedra defined by circular-ones matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3439149)