Sciweavers

5214 search results - page 28 / 1043
» The Online Specialization Problem
Sort
View
ISAAC
1999
Springer
107views Algorithms» more  ISAAC 1999»
13 years 11 months ago
Carrying Umbrellas: An Online Relocation Problem on Graphs
We introduce an online relocation problem on a graph, in which a player who walks around the nodes makes decisions on whether to relocate mobile resources, while not knowing the fu...
Jae-Ha Lee, Chong-Dae Park, Kyung-Yong Chwa
DAM
2010
79views more  DAM 2010»
13 years 7 months ago
On the sum minimization version of the online bin covering problem
Given a set of m identical bins of size 1, the online input consists of a (potentially, infinite) stream of items in (0, 1]. Each item is to be assigned to a bin upon arrival. The ...
János Csirik, Leah Epstein, Csanád I...
IPL
2008
114views more  IPL 2008»
13 years 7 months ago
The online Prize-Collecting Traveling Salesman Problem
We study the online version of the Prize-Collecting Traveling Salesman Problem (PCTSP), a generalization of the Traveling Salesman Problem (TSP). In the TSP, the salesman has to v...
Giorgio Ausiello, Vincenzo Bonifaci, Luigi Laura
CSO
2009
IEEE
14 years 2 months ago
Competitive Analysis of Online Price Discount Replacement Problem
When a paid price discount activity occurs, the decisionmaker must decide whether or not and when to pay the additional fees for preferential price in an online fashion. This prob...
Lili Ding, Xinmin Liu, Wanglin Kang
STOC
2003
ACM
98views Algorithms» more  STOC 2003»
14 years 7 months ago
The online set cover problem
Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbi...