794 search results - page 46 / 159 » Improved algorithms for orienteering and related problems |
212
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
We study integrality gaps and approximability of two closely related problems on directed graphs. Given a set V of n nodes in an underlying asymmetric metric and two specified nod...
241
click to vote
IFIPTCS
2010
15 years 4 months ago
2010
We present in this paper a 5/2-approximation algorithm for scheduling rigid jobs on multi-organizations. For a given set of n jobs, the goal is to construct a schedule for N organi...
183
click to vote
IJCV
2006
15 years 6 months ago
2006
In this paper we address the problem of recovering 3D non-rigid structure from a sequence of images taken with a stereo pair. We have extended existing non-rigid factorization algo...
172
click to vote
WINE
2007
Springer
16 years 23 days ago
2007
Springer
Abstract. We consider the problem of computing additively approximate Nash equilibria in non-cooperative two-player games. We provide a new polynomial time algorithm that achieves ...
197
click to vote
CPAIOR
2008
Springer
15 years 8 months ago
2008
Springer
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...