3874 search results - page 234 / 775 » Approximation Algorithms for k-hurdle Problems |
160
click to vote
SODA
1993
ACM
15 years 5 months ago
1993
ACM
Given a set of n points in d-dimensional Euclidean space, S ⊂ Ed , and a query point q ∈ Ed , we wish to determine the nearest neighbor of q, that is, the point of S whose Euc...
137
click to vote
IPPS
2005
IEEE
15 years 9 months ago
2005
IEEE
: A fundamental problem in communication networks is wavelength assignment (WA): given a set of routing paths on a network, assign a wavelength to each path such that the paths wit...
124
click to vote
COCOON
2005
Springer
15 years 9 months ago
2005
Springer
Given a set of leaf-labelled trees with identical leaf sets, the well-known MAST problem consists of finding a subtree homeomorphically included in all input trees and with the la...
149
click to vote
SIAMCOMP
2000
15 years 4 months ago
2000
There are several results available in the literature dealing with efficient construction of t-spanners for a given set S of n points in Rd. t-spanners are Euclidean graphs in whic...
119
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
In an implicit combinatorial optimization problem, the constraints are not enumerated explicitly but rather stated implicitly through equations, other constraints or auxiliary alg...