Algorithms - ESA 2003

DOI10.1007/b13632zbMath1266.68022WikidataQ60299159 ScholiaQ60299159MaRDI QIDQ5897239

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

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

90B18: Communication networks in operations research

68M10: Network design and communication in computer systems

68R10: Graph theory (including graph drawing) in computer science

Related Items

Parameterized complexity of Min-power multicast problems in wireless ad hoc networks, Approximating minimum-power degree and connectivity problems, Minimum power assignment in wireless ad hoc networks with spanner property, Sharing the cost of multicast transmissions in wireless networks, On the complexity of minimizing interference in ad-hoc and sensor networks, On minimum power connectivity problems, Approximating minimum power covers of intersecting families and directed edge-connectivity problems, Wireless network design via 3-decompositions, An LP-based heuristic algorithm for the node capacitated in-tree packing problem, Energy-efficient communication in multi-interface wireless networks, Greedy approximations for minimum submodular cover with submodular cost, Improved approximation results for the minimum energy broadcasting problem, Bounded-hops power assignment in ad hoc wireless networks, The polymatroid Steiner problems, The complexity of the node capacitated in-tree packing problem, The Min-Power Multicast Problems in Wireless Ad Hoc Networks: A Parameterized View, Energy-Efficient Communication in Multi-interface Wireless Networks, Energy Consumption Minimization in Ad Hoc Wireless and Multi-interface Networks