Pages that link to "Item:Q3548718"

The following pages link to On the hardness of range assignment problems (Q3548718):

Displaying 11 items.

• A geometric characterisation of the quadratic min-power centre (Q297177) (← links)
• A greedy topology design to accelerate consensus in broadcast wireless sensor networks (Q483049) (← links)
• Connecting a set of circles with minimum sum of radii (Q1699280) (← links)
• The homogeneous broadcast problem in narrow and wide strips. I: Algorithms (Q2415369) (← links)
• Submodular Formulations for Range Assignment Problems (Q2883570) (← links)
• Construction of Minimum Power 3-Connected Subgraph with k Backbone Nodes in Wireless Sensor Networks (Q3296835) (← links)
• Approximation algorithms for minimum power k backbone node r-connected subgraph problem in wireless sensor networks (Q5216451) (← links)
• Probabilistic properties of highly connected random geometric graphs (Q5919114) (← links)
• The Online Broadcast Range-Assignment Problem (Q6065469) (← links)
• The online broadcast range-assignment problem (Q6088305) (← links)
• Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem (Q6202754) (← links)