A New Lower Bound for he Frequency Assignment Problem Reporter : Sang Date : 2005/01/06.
20
A New Lower Bound for he Frequency Assignment Problem Reporter : Sang Date : 2005/01/06
-
date post
20-Dec-2015 -
Category
Documents
-
view
222 -
download
0
Transcript of A New Lower Bound for he Frequency Assignment Problem Reporter : Sang Date : 2005/01/06.
A New Lower Bound for he Frequency Assignment Problem
Reporter : Sang
Date : 2005/01/06
• :be a set of cells in a cellular system
• :a requirement vector on X is an n-vector with nonnegative integer components.
• :a compatibility matrix on X is a symmetric matrix.
• :a triple characterizes a FAP
•If ,cell and are said to be v-compatible with each other.
Theorem 1 :Let be an FAP,and assume there exist a subset pair of X such that
First Kind :
Second Kind :
