1999
DOI: 10.1109/25.752578
|View full text |Cite
|
Sign up to set email alerts
|

Fixed preference channel assignment for cellular telephone systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
13
0
1

Year Published

2000
2000
2015
2015

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 18 publications
(14 citation statements)
references
References 17 publications
0
13
0
1
Order By: Relevance
“…4.¨is a priority borrower if it is a borrower and either has no Ž . neighboring borrower or has priority with respect to its base color over its neighboring borrowers.…”
Section: A 2-local Static Algorithm With Performance Ratio 17r12mentioning
confidence: 99%
See 1 more Smart Citation
“…4.¨is a priority borrower if it is a borrower and either has no Ž . neighboring borrower or has priority with respect to its base color over its neighboring borrowers.…”
Section: A 2-local Static Algorithm With Performance Ratio 17r12mentioning
confidence: 99%
“…It is easy to see that this algorithm is an approximation w x algorithm with performance ratio 3. Janssen et al 4 propose a different Ž . algorithm called Fixed Preference Allocation FPA that is guaranteed to use no more than 3r2 times the minimum number of colors required.…”
Section: Introductionmentioning
confidence: 99%
“…There have been previous papers addressing the MS-FAP [e.g., 3,4,[6][7][8][9][10][11][12][13] including those that minimize the maximum frequency assigned.…”
Section: Previous Approachesmentioning
confidence: 99%
“…For Theorem 1.1 this is an algorithm which can be considered 'folklore' in the telecommunications literature, and for Theorem 1.2 it is an algorithm developed in [12] and [5]. The crux of the proofs of the theorems lies in establishing that no possible algorithm can do better.…”
Section: Introductionmentioning
confidence: 99%