Parameterized complexity of Min-power multicast problems in wireless ad hoc networks (Q388087): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q17 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68M10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6239351 / rank
 
Normal rank
Property / zbMATH Keywords
 
power assignment
Property / zbMATH Keywords: power assignment / rank
 
Normal rank
Property / zbMATH Keywords
 
W[1]-/W[2]-hardness
Property / zbMATH Keywords: W[1]-/W[2]-hardness / rank
 
Normal rank
Property / zbMATH Keywords
 
fixed-parameter tractability
Property / zbMATH Keywords: fixed-parameter tractability / rank
 
Normal rank
Property / zbMATH Keywords
 
lower bound
Property / zbMATH Keywords: lower bound / rank
 
Normal rank

Revision as of 14:23, 29 June 2023

scientific article
Language Label Description Also known as
English
Parameterized complexity of Min-power multicast problems in wireless ad hoc networks
scientific article

    Statements

    Parameterized complexity of Min-power multicast problems in wireless ad hoc networks (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    19 December 2013
    0 references
    power assignment
    0 references
    W[1]-/W[2]-hardness
    0 references
    fixed-parameter tractability
    0 references
    lower bound
    0 references

    Identifiers