scientific article; zbMATH DE number 6783449

zbMath1373.68053MaRDI QIDQ5365097

Debmalya Panigrahi

Publication date: 29 September 2017

Full work available at URL: http://dl.acm.org/citation.cfm?id=2133114

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Approximation algorithms (68W25)

Related Items (12)

Parameterized Algorithms for Power-Efficient Connected Symmetric Wireless Sensor Networks ⋮ Approximating activation edge-cover and facility location problems ⋮ Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments ⋮ Survivable network activation problems ⋮ Minimum shared‐power edge cut ⋮ Hardness of minimum barrier shrinkage and minimum installation path ⋮ An \(O(\sqrt{k})\)-approximation algorithm for minimum power \(k\) edge disjoint \(st\)-paths ⋮ Approximating minimum power edge-multi-covers ⋮ Computing a tree having a small vertex cover ⋮ Unnamed Item ⋮ Spider Covering Algorithms for Network Design Problems ⋮ Approximation algorithms for minimum power k backbone node r-connected subgraph problem in wireless sensor networks

This page was built for publication: