794 search results - page 8 / 159 » Improved algorithms for orienteering and related problems |
TAMC
2009
Springer
14 years 3 months ago
2009
Springer
We investigate a natural combinatorial optimization problem called the Label Cut problem. Given an input graph G with a source s and a sink t, the edges of G are classified into ...
SODA
1998
ACM
13 years 10 months ago
1998
ACM
A fundamental facility location problem is to choose the location of facilities, such as industrial plants and warehouses, to minimize the cost of satisfying the demand for some c...
JCP
2008
13 years 8 months ago
2008
The Self Organizing Map (SOM) involves neural networks, that learns the features of input data thorough unsupervised, competitive neighborhood learning. In the SOM learning algorit...
FOCS
2003
IEEE
14 years 2 months ago
2003
IEEE
In this paper, we give the rst constant-factor approximationalgorithmfor the rooted Orienteering problem, as well as a new problem that we call the Discounted-Reward TSP, motivate...
CVPR
2005
IEEE
14 years 10 months ago
2005
IEEE
Assume that we have two perspective images with known intrinsic parameters except for an unknown common focal length. It is a minimally constrained problem to find the relative or...