ON THE PERFORMANCE OF HEURISTICS FOR BROADCAST SCHEDULING

DOI10.1142/9789812796592_0004zbMath1114.90379OpenAlexW122661145MaRDI QIDQ3416279

Clayton W. Commander, Sergiy I. Butenko, Panos M. Pardalos

Publication date: 19 January 2007

Published in: Theory and Algorithms for Cooperative Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/9789812796592_0004

zbMATH Keywords

combinatorial optimizationNP-completebroadcast scheduling problemad-hoc networks

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (3)

A combinatorial algorithm for the TDMA message scheduling problem ⋮ Optimal coloring for data collection in tree-based wireless sensor networks ⋮ Approximate dynamic programming for link scheduling in wireless mesh networks

Uses Software

• GRASP

This page was built for publication: ON THE PERFORMANCE OF HEURISTICS FOR BROADCAST SCHEDULING