123 search results - page 5 / 25 » The minimum Manhattan network problem: Approximations and ex... |
DAM
1999
13 years 6 months ago
1999
This paper deals with the problem of constructing Steiner trees of minimum weight with diameter bounded by d, spanning a given set of vertices in a graph. Exact solutions or logar...
JCO
2006
13 years 6 months ago
2006
We study a novel "coverage by directional sensors" problem with tunable orientations on a set of discrete targets. We propose a Maximum Coverage with Minimum Sensors (MCM...
NETWORKS
2002
13 years 6 months ago
2002
Consider a requirement graph whose vertices represent customers and an edge represents the need to route a unit of flow between its end vertices along a single path. All of these ...
CPM
2000
Springer
13 years 11 months ago
2000
Springer
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...
STOC
2007
ACM
14 years 7 months ago
2007
ACM
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...