3875 search results - page 157 / 775 » Approximation algorithms for the 0-extension problem |
162
click to vote
ENDM
2010
15 years 5 months ago
2010
Abstract We study the version of the asymmetric prize collecting traveling salesman problem, where the objective is to find a directed tour that visits a subset of vertices such th...
138
Voted
CP
2006
Springer
15 years 8 months ago
2006
Springer
We propose a branch and prune algorithm that is able to compute inner and outer approximations of the solution set of an existentially quantified constraint where existential param...
127
click to vote
SIAMJO
2010
14 years 11 months ago
2010
In this paper we propose a new exchange method for solving convex semi-infinite programming (CSIP) problems. We introduce a new dropping-rule in the proposed exchange algorithm, wh...
126
click to vote
WEA
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Extensions of the randomized tournaments techniques introduced in [6, 7] to approximate solutions of 1-median and diameter computation of finite subsets of general metri...
142
click to vote
APPROX
2008
Springer
15 years 7 months ago
2008
Springer
We study the directed minimum latency problem: given an n-vertex asymmetric metric (V, d) with a root vertex r V , find a spanning path originating at r that minimizes the sum of...