A combinatorial algorithm for the TDMA message scheduling problem (Q839680): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: GRASP / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10589-007-9143-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2052521546 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Wireless mesh networks: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Traffic assignment in communication satellites / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-slot assignment for TDMA-systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unit disk graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE PERFORMANCE OF HEURISTICS FOR BROADCAST SCHEDULING / rank
 
Normal rank
Property / cites work
 
Property / cites work: A probabilistic heuristic for a computationally difficult set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy randomized adaptive search procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2776563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for SS/TDMA scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Link scheduling in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5538306 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse graphs usually have exponentially many optimal colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A GRASP for coloring sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial algorithm for message scheduling on controller area networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5395365 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4452897 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 23:20, 1 July 2024

scientific article
Language Label Description Also known as
English
A combinatorial algorithm for the TDMA message scheduling problem
scientific article

    Statements

    A combinatorial algorithm for the TDMA message scheduling problem (English)
    0 references
    0 references
    0 references
    2 September 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    TDMA networks
    0 references
    heuristics
    0 references
    graph algorithms
    0 references
    optimization
    0 references
    \(\mathcal{NP}\)-hard
    0 references
    0 references