Sciweavers

227 search results - page 17 / 46
» A Competitive Algorithm for the General 2-Server Problem
Sort
View
COCOON
1998
Springer
14 years 21 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
ALGORITHMICA
2010
143views more  ALGORITHMICA 2010»
13 years 8 months ago
Absolute and Asymptotic Bounds for Online Frequency Allocation in Cellular Networks
Given a cellular (mobile telephone) network, whose geographical coverage area is divided into hexagonal cells, phone calls are serviced by assigning frequencies to them so that no...
Joseph Wun-Tat Chan, Francis Y. L. Chin, Deshi Ye,...
SODA
2008
ACM
140views Algorithms» more  SODA 2008»
13 years 10 months ago
Minimizing average latency in oblivious routing
We consider the problem of minimizing average latency cost while obliviously routing traffic in a network with linear latency functions. This is roughly equivalent to minimizing t...
Prahladh Harsha, Thomas P. Hayes, Hariharan Naraya...
ALGORITHMICA
2010
155views more  ALGORITHMICA 2010»
13 years 8 months ago
Bin Packing with Rejection Revisited
We consider the following generalization of bin packing. Each item is associated with a size bounded by 1, as well as a rejection cost, that an algorithm must pay if it chooses not...
Leah Epstein
MFCS
2001
Springer
14 years 27 days ago
News from the Online Traveling Repairman
In the traveling repairman problem (Trp), a tour must be found through every one of a set of points (cities) in some metric space such that the weighted sum of completion times of ...
Sven Oliver Krumke, Willem de Paepe, Diana Poensge...