3192 search results - page 163 / 639 » The minimum latency problem |
133
click to vote
GECCO
2009
Springer
15 years 8 months ago
2009
Springer
Given a collection of terminals, each with a demand, a collection of concentrators, each with a capacity, and costs of connecting the terminals to the concentrators, the terminal ...
123
click to vote
CIAC
2000
Springer
15 years 8 months ago
2000
Springer
We consideralgorithms for a simple one-dimensionalpoint placement problem: given N points on a line, and noisy measurements of the distances between many pairs of them, estimate th...
139
click to vote
ALGORITHMICA
2010
15 years 4 months ago
2010
Abstract We consider a variant of the path cover problem, namely, the k-fixedendpoint path cover problem, or kPC for short, on interval graphs. Given a graph G and a subset T of k ...
143
click to vote
AHSWN
2006
15 years 4 months ago
2006
Abstract-- We present a new, biologically-inspired algorithm for the problem of covering a given region with wireless "units" (sensors or base-stations). The general prob...
117
Voted
TIT
2008
15 years 4 months ago
2008
The identifying code problem for a given graph involves finding a minimum set of vertices whose neighborhoods uniquely overlap at any given graph vertex. Initially introduced in 1...