The following pages link to Algorithms - ESA 2003 (Q5897239):
Displaying 34 items.
- Power optimization in ad hoc wireless network topology control with biconnectivity requirements (Q336735) (← links)
- Parameterized complexity of Min-power multicast problems in wireless ad hoc networks (Q388087) (← links)
- Approximating minimum-power degree and connectivity problems (Q547290) (← links)
- Performance evaluation for energy efficient topologic control in ad hoc wireless networks (Q703562) (← links)
- Improved approximation algorithms for maximum lifetime problems in wireless networks (Q714776) (← links)
- Dual-based approximation algorithms for cut-based network connectivity problems (Q722530) (← links)
- Minimum power assignment in wireless ad hoc networks with spanner property (Q857765) (← links)
- Sharing the cost of multicast transmissions in wireless networks (Q861267) (← links)
- On approximate optimal dual power assignment for biconnectivity and edge-biconnectivity (Q924146) (← links)
- On the complexity of minimizing interference in ad-hoc and sensor networks (Q936529) (← links)
- On dual power assignment optimization for biconnectivity (Q965816) (← links)
- On minimum power connectivity problems (Q972357) (← links)
- Approximating minimum power covers of intersecting families and directed edge-connectivity problems (Q974743) (← links)
- Wireless network design via 3-decompositions (Q990943) (← links)
- Establishing symmetric connectivity in directional wireless sensor networks equipped with \(2\pi/3\) antennas (Q1679501) (← links)
- Minimizing the number of max-power users in ad-hoc wireless networks with minimum node degree requirements (Q1751413) (← links)
- An LP-based heuristic algorithm for the node capacitated in-tree packing problem (Q1762017) (← links)
- Power assignment for \(k\)-connectivity in wireless ad hoc networks (Q1781807) (← links)
- Energy-efficient communication in multi-interface wireless networks (Q1946498) (← links)
- The complexity of symmetric connectivity in directional wireless sensor networks (Q2307492) (← links)
- Greedy approximations for minimum submodular cover with submodular cost (Q2379694) (← links)
- Improved approximation results for the minimum energy broadcasting problem (Q2471706) (← links)
- Bounded-hops power assignment in ad hoc wireless networks (Q2492211) (← links)
- The polymatroid Steiner problems (Q2569165) (← links)
- Approximation Bounds on the Number of Mixedcast Rounds in Wireless Ad-Hoc Networks (Q2870034) (← links)
- The complexity of the node capacitated in-tree packing problem (Q2892141) (← links)
- The Min-Power Multicast Problems in Wireless Ad Hoc Networks: A Parameterized View (Q3004665) (← links)
- Energy-Efficient Communication in Multi-interface Wireless Networks (Q3182916) (← links)
- Energy Consumption Minimization in Ad Hoc Wireless and Multi-interface Networks (Q3404476) (← links)
- Parameterized complexity of min-power asymmetric connectivity (Q5918282) (← links)
- Improved approximation algorithms for minimum power covering problems (Q5919677) (← links)
- 1.61-approximation for min-power strong connectivity with two power levels (Q5963620) (← links)
- Improved algorithms in directional wireless sensor networks (Q6046631) (← links)
- Symmetric Connectivity in Wireless Sensor Networks with π/3 Directional Antennas (Q6114860) (← links)
