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

DOI10.1016/j.tcs.2012.02.040zbMath1358.68116OpenAlexW1997182769MaRDI QIDQ388087

Weizhong Luo, Jianxin Wang, Jiong Guo, Qilong Feng

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 boundpower assignmentfixed-parameter tractabilityW[1-/W[2]-hardness]

Mathematics Subject Classification ID

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

Related Items (2)

Improved parameterized algorithms for minimum link-length rectilinear spanning path problem ⋮ Partition on trees with supply and demand: kernelization and algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the parameterized complexity of multiple-interval graph problems
• On problems without polynomial kernels
• The Min-Power Multicast Problems in Wireless Ad Hoc Networks: A Parameterized View
• Kernelization Hardness of Connectivity Problems in d-Degenerate Graphs
• Fourier meets M\"{o}bius: fast subset convolution
• Bounded-Hop Energy-Efficient Broadcast in Low-Dimensional Metrics Via Coresets
• Kernel Bounds for Disjoint Cycles and Disjoint Paths
• STACS 2004
• Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs
• The steiner problem in graphs
• Algorithms - ESA 2003

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