Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

129

Voted

NETWORKS
2008

208views Computer Networks» more NETWORKS 2008»

Competitive algorithms and lower bounds for online randomized call control in cellular networks

15 years 3 months ago

Competitive algorithms and lower bounds for online randomized call control in cellular networks

Download www.ceid.upatras.gr

Ioannis Caragiannis, Christos Kaklamanis, Evi Papa

Real-time Traffic

Computer Networks | NETWORKS 2008 |

claim paper

Related Content

» New Bounds on the Competitiveness of Randomized Online Call Control in Cellular Networks

» Efficient OnLine Frequency Allocation and Call Control in Cellular Networks

» Absolute and Asymptotic Bounds for Online Frequency Allocation in Cellular Networks

» Online Randomized Call Control Revisited

» Online ThroughputCompetitive Algorithm for Multicast Routing and Admission Control

» Greedy online frequency allocation in cellular networks

» Three Results on Frequency Assignment in Linear Cellular Networks

» A Preemptive Algorithm for Maximizing Disjoint Paths on Trees

» Admission control to minimize rejections and online set cover with repetitions

Post Info
More Details (n/a)

Added	14 Dec 2010
Updated	14 Dec 2010
Type	Journal
Year	2008
Where	NETWORKS
Authors	Ioannis Caragiannis, Christos Kaklamanis, Evi Papaioannou

Comments (0)