Parameterized complexity of Min-power multicast problems in wireless ad hoc networks
DOI10.1016/J.TCS.2012.02.040zbMATH Open1358.68116OpenAlexW1997182769MaRDI QIDQ388087FDOQ388087
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
Recommendations
- The min-power multicast problems in wireless ad hoc networks: a parameterized view
- Parameterized complexity of min-power asymmetric connectivity
- Parameterized complexity of min-power asymmetric connectivity
- Minimum power multicasting problem in wireless networks
- Bounded-hops power assignment in ad hoc wireless networks
lower boundfixed-parameter tractabilitypower assignmentW[1-/W[2]-hardness]
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)
Cites Work
- On problems without polynomial kernels
- Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the parameterized complexity of multiple-interval graph problems
- Fourier meets M\"{o}bius: fast subset convolution
- The steiner problem in graphs
- Kernelization Hardness of Connectivity Problems in d-Degenerate Graphs
- The min-power multicast problems in wireless ad hoc networks: a parameterized view
- Bounded-Hop Energy-Efficient Broadcast in Low-Dimensional Metrics Via Coresets
- Kernel Bounds for Disjoint Cycles and Disjoint Paths
- Title not available (Why is that?)
- STACS 2004
- Network lifetime and power assignment in ad hoc wireless networks
Cited In (6)
- 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
- Parameterized complexity of min-power asymmetric connectivity
- 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
- Partition on trees with supply and demand: kernelization and algorithms
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)
