4843 search results - page 307 / 969 » The Shortcut Problem - Complexity and Approximation |
111
click to vote
DAM
2006
15 years 4 months ago
2006
Let P be a combinatorial optimization problem, and let A be an approximation algorithm for P. The domination ratio domr(A, s) is the maximal real q such that the solution x(I) obt...
151
click to vote
IPL
2008
15 years 3 months ago
2008
We consider the problem of computing shortest paths in three-dimensions in the presence of a single-obstacle polyhedral terrain, and present a new algorithm that for any p 1, comp...
125
click to vote
IPPS
2006
IEEE
15 years 10 months ago
2006
IEEE
A new class of parallel normalized preconditioned conjugate gradient type methods in conjunction with normalized approximate inverses algorithms, based on normalized approximate f...
134
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...
144
click to vote
FOCS
2000
IEEE
15 years 8 months ago
2000
IEEE
In many optimization problems, one seeks to allocate a limited set of resources to a set of individuals with demands. Thus, such allocations can naturally be viewed as vectors, wi...