Parameterized complexity of Min-power multicast problems in wireless ad hoc networks

DOI10.1016/J.TCS.2012.02.040MaRDI QIDQ388087zbMATH OpenOpenAlexFDO

Authors Jianxin Wang, Weizhong Luo, Qilong Feng, Jiong Guo

Publication date 19 December 2013

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2012.02.040

zbMATH Keywords

lower boundfixed-parameter tractabilitypower assignmentW[1-/W[2]-hardness]

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Network design and communication in computer systems (68M10)

Recommendations

• The min-power multicast problems in wireless ad hoc networks: a parameterized view
• Minimum power multicasting problem in wireless networks
• Bounded-hops power assignment in ad hoc wireless networks

Cites work

• scientific article; zbMATH DE number 1161563 (Why is no real title available?)
• scientific article; zbMATH DE number 1500550 (Why is no real title available?)
• scientific article; zbMATH DE number 2234775 (Why is no real title available?)
• Bounded-Hop Energy-Efficient Broadcast in Low-Dimensional Metrics Via Coresets
• Fourier meets M\"{o}bius: fast subset convolution
• Kernel Bounds for Disjoint Cycles and Disjoint Paths
• Kernelization Hardness of Connectivity Problems in d-Degenerate Graphs
• Network lifetime and power assignment in ad hoc wireless networks
• On problems without polynomial kernels
• On the parameterized complexity of multiple-interval graph problems
• STACS 2004
• Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs
• The min-power multicast problems in wireless ad hoc networks: a parameterized view
• The steiner problem in graphs

Cited in

(5)

• Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments
• The min-power multicast problems in wireless ad hoc networks: a parameterized view
• Partition on trees with supply and demand: kernelization and algorithms
• Two new algorithms for the min-power broadcast problem in static ad hoc networks
• Improved parameterized algorithms for minimum link-length rectilinear spanning path problem

This page was built for publication: Parameterized complexity of Min-power multicast problems in wireless ad hoc networks

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