Sciweavers

7 search results - page 2 / 2
» Competitive Online Routing in Geometric Graphs
Sort
View
AAIM
2009
Springer
143views Algorithms» more  AAIM 2009»
13 years 3 months ago
Discrete online TSP
In this paper we introduce a discrete version of the online traveling salesman problem (DOLTSP). We represent the metric space using a weighted graph, where the server is allowed t...
Mauro Aprea, Esteban Feuerstein, Gustavo Sadovoy, ...
SPAA
2005
ACM
13 years 10 months ago
Admission control to minimize rejections and online set cover with repetitions
We study the admission control problem in general networks. Communication requests arrive over time, and the online algorithm accepts or rejects each request while maintaining the...
Noga Alon, Yossi Azar, Shai Gutner