465 search results - page 1 / 93 » On the Hardness of Range Assignment Problems |
CIAC
2006
Springer
13 years 8 months ago
2006
Springer
We investigate the computational hardness of the Connectivity, the Strong Connectivity and the Broadcast type of Range Assignment Problems in R2 and R3. We present new reductions ...
FOCS
2004
IEEE
13 years 8 months ago
2004
IEEE
The Metric Labeling problem is an elegant and powerful mathematical model capturing a wide range of classification problems. The input to the problem consists of a set of labels a...
SODA
2010
ACM
14 years 2 months ago
2010
ACM
The quadratic assignment problem (QAP) is a central problem in combinatorial optimization. Several famous computationally hard tasks, such as graph matching, partitioning, and the...
IPCO
1996
13 years 6 months ago
1996
This paper investigates a restricted version of the Quadratic Assignment Problem (QAP), where one of the coefficient matrices is an Anti-Monge matrix with non-decreasing rows and ...
MOBIHOC
2001
ACM
14 years 4 months ago
2001
ACM
In this paper we consider the following problem for ad hoc networks: assume that n nodes are distributed in a d-dimensional region, with 1d3, and assume that all the nodes have th...