Skip to Main Content
Green Communications and Networking
book

Green Communications and Networking

by F. Richard Yu, Xi Zhang, Victor C.M. Leung
April 2016
Intermediate to advanced content levelIntermediate to advanced
399 pages
11h 49m
English
CRC Press
Content preview from Green Communications and Networking
A Practical Example of GES Application 169
On the basis of (6.6) the graph of moves G
m
=(M, I) can be defined. In
this graph M is the set of moves and I is a E×E matrix where each row is the
vector v
m
l
.InG
m
the i-th node represents the move m
i
with a weight equal
to the number of switched off links, i.e., the |S
m
l
|.InG
m
=(M, I) there is an
undirected edge between nodes i and j if v
m
i
[j] = 1. Then, solving the EAR
problem coincides with finding the maximum clique in G
m
, that is an NP-hard
problem. It is possible to define a greedy algorithm, named Max
Compatibility
Heuristic; the heuristic is able to detect a set of compatible moves, trying to
maximize the num ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Green Networking and Communications

Green Networking and Communications

Shafiullah Khan, Jaime Lloret Mauri
Green Communications

Green Communications

Jinsong Wu, Sundeep Rangan, Honggang Zhang

Publisher Resources

ISBN: 9781439899144