82 search results - page 3 / 17 » Approximation Algorithms for Orienteering with Time Windows |
123
click to vote
AAIM
2007
Springer
15 years 5 months ago
2007
Springer
Given an undirected graph G = (V, E) and a weight function w : E → Z+ , we consider the problem of orienting all edges in E so that the maximum weighted outdegree among all verti...
114
click to vote
SODA
2012
ACM
13 years 2 months ago
2012
ACM
In the Stochastic Orienteering problem, we are given a metric, where each node also has a job located there with some deterministic reward and a random size. (Think of the jobs as...
130
click to vote
DAWAK
2006
Springer
15 years 3 months ago
2006
Springer
Recently, the data stream, which is an unbounded sequence of data elements generated at a rapid rate, provides a dynamic environment for collecting data sources. It is likely that ...
FOCS
2003
IEEE
15 years 4 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...
118
click to vote
PODS
2006
ACM
15 years 11 months ago
2006
ACM
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...