Power assignment problems in wireless communication: Covering points by disks, reaching few receivers quickly, and energy-efficient travelling salesman tours

Keyphrases

• Wireless Communication 100%
• Energy Efficient 100%
• Assignment Problem 100%
• Wireless Networks 100%
• Power Assignment 100%
• Multicast 100%
• Travelling Salesman Tour 100%
• Wireless Devices 100%
• Wireless Sensor Networks 50%
• Distance Measure 50%
• Source Node 50%
• Power Consumption 50%
• Constant-factor Approximation Algorithm 50%
• K-hop 50%
• Euclidean Distance 50%
• Transmission Power 50%
• First Problem 50%
• Bounded Hops 50%
• Overall Energy 50%
• TSP Tour 50%
• Size-independent 50%
• Metric TSP 50%
• Non-metricity 50%
• TSP Problem 50%
• Data Aggregation 50%
• Aggregation Mechanism 50%
• Communication Graph 50%
• Energy Consumed 50%
• Wireless Connection 50%
• Communication Tasks 50%
• Fundamental Class 50%
• Squared Distance 50%
• Squared Euclidean Distance 50%
• Point-to-point Routing 50%

Computer Science

• Energy Efficient 100%
• Assignment Problem 100%
• Wireless Networks 100%
• Wireless Communication 100%
• Traveling Salesman 100%
• Wireless Device 100%
• Power Consumption 50%
• Wireless Sensor Network 50%
• Approximation Algorithms 50%
• Euclidean Distance 50%
• Multicasting 50%
• Distance Measure 50%
• Data Aggregation 50%
• Multicast Operation 50%
• Transmission Power 50%
• Communication Graph 50%
• Desired Property 50%
• Squared Distance 50%
• Wireless Connection 50%
• Squared Euclidean Distance 50%

Mathematics

• Running Time 100%
• Edge 100%
• Polynomial 100%
• Euclidean Distance 100%
• Traveling Salesman Tour 100%
• Linear Time 50%
• Source Node 50%
• Wireless Sensor Network 50%