Algorithms - ESA 2003

DOI10.1007/b13632zbMath1266.68022OpenAlexW1827234103WikidataQ60299159 ScholiaQ60299159MaRDI QIDQ5897239

Sanjiv Kapoor, Alexander Olshevsky, Gruia Călinescu, Alexander Z. Zelikovsky

Publication date: 3 March 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b13632

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (26)

The complexity of the node capacitated in-tree packing problem ⋮ Greedy approximations for minimum submodular cover with submodular cost ⋮ Energy-Efficient Communication in Multi-interface Wireless Networks ⋮ Minimum power assignment in wireless ad hoc networks with spanner property ⋮ Sharing the cost of multicast transmissions in wireless networks ⋮ Establishing symmetric connectivity in directional wireless sensor networks equipped with \(2\pi/3\) antennas ⋮ Parameterized complexity of Min-power multicast problems in wireless ad hoc networks ⋮ Improved algorithms in directional wireless sensor networks ⋮ Symmetric Connectivity in Wireless Sensor Networks with π/3 Directional Antennas ⋮ Energy-efficient communication in multi-interface wireless networks ⋮ On the complexity of minimizing interference in ad-hoc and sensor networks ⋮ The Min-Power Multicast Problems in Wireless Ad Hoc Networks: A Parameterized View ⋮ Improved approximation results for the minimum energy broadcasting problem ⋮ An LP-based heuristic algorithm for the node capacitated in-tree packing problem ⋮ Approximating minimum-power degree and connectivity problems ⋮ On minimum power connectivity problems ⋮ Approximating minimum power covers of intersecting families and directed edge-connectivity problems ⋮ Bounded-hops power assignment in ad hoc wireless networks ⋮ Wireless network design via 3-decompositions ⋮ Dual-based approximation algorithms for cut-based network connectivity problems ⋮ Improved approximation algorithms for minimum power covering problems ⋮ 1.61-approximation for min-power strong connectivity with two power levels ⋮ Parameterized complexity of min-power asymmetric connectivity ⋮ The complexity of symmetric connectivity in directional wireless sensor networks ⋮ Energy Consumption Minimization in Ad Hoc Wireless and Multi-interface Networks ⋮ The polymatroid Steiner problems

This page was built for publication: Algorithms - ESA 2003