Sciweavers

465 search results - page 2 / 93
» On the Hardness of Range Assignment Problems
Sort
View
SIROCCO
2004
13 years 6 months ago
The Range Assignment Problem in Static Ad-Hoc Networks on Metric Spaces
In this paper we study the range assignment problem in static ad-hoc networks on metric spaces. We consider the h-strong connectivity and h-broadcast problems on trees, high dimens...
Deshi Ye, Hu Zhang
ESA
2000
Springer
98views Algorithms» more  ESA 2000»
13 years 8 months ago
The Minimum Range Assignment Problem on Linear Radio Networks
Andrea E. F. Clementi, Afonso Ferreira, Paolo Penn...
STACS
2000
Springer
13 years 8 months ago
The Power Range Assignment Problem in Radio Networks on the Plane
Andrea E. F. Clementi, Paolo Penna, Riccardo Silve...
CORR
2007
Springer
217views Education» more  CORR 2007»
13 years 4 months ago
Hard constraint satisfaction problems have hard gaps at location 1
An instance of the maximum constraint satisfaction problem (Max CSP) is a nite collection of constraints on a set of variables, and the goal is to assign values to the variables ...
Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen