Fast heuristics for the frequency channel assignment problem in multi-hop wireless networks (Q322774): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Models and solution techniques for frequency assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cellular network configuration with co-channel and adjacent-channel interference constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3715148 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New methods to color the vertices of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687258 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Negative Cycle Separation in Wireless Network Design / 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: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The capacity of wireless networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchical cellular network design with channel allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The greedy coloring is a bad probabilistic algorithm / 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 graph coloring algorithm for large scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact approach for the vertex coloring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on vertex coloring problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A topology control approach for utilizing multiple channels in multi-radio wireless mesh networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting plane algorithm for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic manipulation, tabu search and frequency assignment / rank
 
Normal rank

Latest revision as of 17:10, 12 July 2024

scientific article
Language Label Description Also known as
English
Fast heuristics for the frequency channel assignment problem in multi-hop wireless networks
scientific article

    Statements

    Fast heuristics for the frequency channel assignment problem in multi-hop wireless networks (English)
    0 references
    0 references
    0 references
    0 references
    7 October 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    channel assignment
    0 references
    heuristics
    0 references
    minimum coloring
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references