1671 search results - page 94 / 335 » On the Covering Steiner Problem |
151
click to vote
CVGIP
2004
15 years 19 days ago
2004
In this paper we present an efficient method for interpolating a piecewise-linear surface between two parallel slices, each consisting of an arbitrary number of (possibly nested) ...
103
Voted
ICALP
2005
Springer
15 years 6 months ago
2005
Springer
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
117
Voted
AHSWN
2006
15 years 25 days 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...
94
Voted
CORR
2004
Springer
15 years 19 days ago
2004
Springer
Abstract. The phylogenetic tree construction is to infer the evolutionary relationship between species from the experimental data. However, the experimental data are often imperfec...
119
Voted
JAL
2006
15 years 22 days ago
2006
: We consider a variety of vehicle routing problems. The input to a problem consists of a graph G = (N, E) and edge lengths l(e) e E. Customers located at the vertices have to be ...