Sciweavers

22 search results - page 2 / 5
» Competitive algorithms and lower bounds for online randomize...
Sort
View
SODA
1998
ACM
99views Algorithms» more  SODA 1998»
13 years 6 months ago
Online Throughput-Competitive Algorithm for Multicast Routing and Admission Control
We present the first polylog-competitive online algorithm for the general multicast admission control and routing problem in the throughput model. The ratio of the number of reque...
Ashish Goel, Monika Rauch Henzinger, Serge A. Plot...
IPL
2007
113views more  IPL 2007»
13 years 4 months ago
Greedy online frequency allocation in cellular networks
The online frequency allocation problem for cellular networks has been well studied in these years. Given a mobile telephone network, whose geographical coverage area is divided i...
Joseph Wun-Tat Chan, Francis Y. L. Chin, Deshi Ye,...
AAIM
2009
Springer
101views Algorithms» more  AAIM 2009»
13 years 11 months ago
Three Results on Frequency Assignment in Linear Cellular Networks
In the frequency assignment problem we are given a graph representing a wireless network and a sequence of requests, where each request is associated with a vertex. Each request h...
Marek Chrobak, Jiri Sgall
ALGORITHMICA
2010
131views more  ALGORITHMICA 2010»
13 years 5 months ago
A Preemptive Algorithm for Maximizing Disjoint Paths on Trees
We consider the online version of the maximum vertex disjoint path problem when the underlying network is a tree. In this problem, a sequence of requests arrives in an online fash...
Yossi Azar, Uriel Feige, Daniel Glasner
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