Sciweavers

594 search results - page 29 / 119
» Travelling Miser Problem
Sort
View
WISE
2003
Springer
14 years 1 months ago
Traversing the Web: Mobility Heuristics for Visually Impaired Surfers
— Movement, or mobility, is key to the accessibility, design, and usability of many websites. While some peripheral mobility issues have been addressed few have centered on the m...
Simon Harper, Carole A. Goble, Robert Stevens
ICASSP
2011
IEEE
12 years 11 months ago
Short and smooth sampling trajectories for compressed sensing
This paper explores a novel setting for compressed sensing (CS) in which the sampling trajectory length is a critical bottleneck and must be minimized subject to constraints on th...
Rebecca M. Willett
IPL
2000
146views more  IPL 2000»
13 years 7 months ago
Better approximations for max TSP
We combine two known polynomial time approximation algorithms for the maximum traveling salesman problem to obtain a randomized algorithm which outputs a solution with expected va...
Refael Hassin, Shlomi Rubinstein
COCOON
1998
Springer
14 years 1 days ago
On The Bahncard Problem
In this paper, we generalize the Ski-Rental Problem to the Bahncard Problem which is an online problem of practical relevance for all travelers. The Bahncard is a railway pass of t...
Rudolf Fleischer
DISOPT
2010
138views more  DISOPT 2010»
13 years 7 months ago
The Delivery Man Problem with time windows
In this paper, a variant of the Traveling Salesman Problem with Time Windows is considered, which consists in minimizing the sum of travel durations between a depot and several cu...
Géraldine Heilporn, Jean-François Co...