Results 1 
2 of
2
A 1Local Asymptotic 13/9Competitive Algorithm for Multicoloring Hexagonal Graphs
 ALGORITHMICA (2009 ) 54 : 557–567
, 2009
"... In the frequency allocation problem, we are given a mobile telephone network, whose geographical coverage area is divided into cells, wherein phone calls are serviced by assigning frequencies to them so that no two calls emanating from the same or neighboring cells are assigned the same frequency. T ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
In the frequency allocation problem, we are given a mobile telephone network, whose geographical coverage area is divided into cells, wherein phone calls are serviced by assigning frequencies to them so that no two calls emanating from the same or neighboring cells are assigned the same frequency. The problem is to use the frequencies efficiently, i.e., minimize the span of frequencies used. The frequency allocation problem can be regarded as a multicoloring problem on a weighted hexagonal graph. In this paper, we give a 1local asymptotic 4/3competitive distributed algorithm for multicoloring a trianglefree hexagonal graph, which is a special case of hexagonal graph. Based on this result, we then propose a 1local asymptotic 13/9competitive algorithm for multicoloring the (generalcase) hexagonal graph, thereby improving the previous 1local 3/2competitive algorithm.
A constantcompetitive algorithm . . .
, 2007
"... Orthogonal Variable Spreading Factor (OVSF) code assignment is a fundamental problem in Wideband CodeDivision MultipleAccess (WCDMA) systems, which plays an important role in third generation mobile communications. In the OVSF problem, codes must be assigned to incoming call requests with differ ..."
Abstract
 Add to MetaCart
Orthogonal Variable Spreading Factor (OVSF) code assignment is a fundamental problem in Wideband CodeDivision MultipleAccess (WCDMA) systems, which plays an important role in third generation mobile communications. In the OVSF problem, codes must be assigned to incoming call requests with different data rate requirements, in such a way that they are mutually orthogonal with respect to an OVSF code tree. An OVSF code tree is a complete binary tree in which each node represents a code associated with the combined bandwidths of its two children. To be mutually orthogonal, each leaftoroot path must contain at most one assigned code. In this paper, we focus on the online version of the OVSF code assignment problem and give a 10competitive algorithm (where the cost is measured by the total number of assignments and reassignments used). Our algorithm improves the previous O(h)competitive result, where h is the height of the code tree, and also another recent constantcompetitive result, where the competitive ratio is only constant under amortized analysis and the constant is not determined. We also improve the lower bound of