`
UNIVERSITA DEGLI STUDI DI BOLOGNA
Dottorato di Ricerca in
Automatica e Ricerca Operativa
XIX Ciclo
The Vertex Coloring Problem and its Generalizations
Enrico Malaguti
A.A. 2003–2006
Contents
- I
- Vertex Coloring Problems
- 9
CONTENTS
- II Fair Routing
- 93
- CONTENTS
- CONTENTS
Acknowledgments
ACKNOWLEDGMENTS
Keywords
Keyworks
List of Figures
LIST OF FIGURES
List of Tables
LIST OF TABLES
Chapter 1
Introduction
1.1 The Vertex Coloring Problem and its Generalizations
1
1Four are enough for any map, see Appel, Haken and Koch [10], the Four Color Conjecture was proposed by Francis Guthrie in 1852
Introduction
∈
The Vertex Coloring Problem and its Generalizations
=1
∀ ∈
=1
- ≤
- ∀
- ∈
- ∈ {
- }
}
∀ ∈
∈ {
- ≤
- ∀
=1
Introduction
∈
- |
- −
- | ≥
- ≥
- ∈
∈
∈
≤
≤
∈ { ∈ {
- ∈
- ∈
- ∈ { −
- − }
∈∈
∈
∈
- ∈
- }
}
∈
∈
=1
The Vertex Coloring Problem and its Generalizations
- ≥
- ∈
∈
=1
- ≤
- ∈
- ∈ {
- }
- ∈
Introduction
1.2 Fair Routing
••
Fair Routing
- ∈
- ∈
Introduction
Part I
Vertex Coloring Problems
Chapter 2
A Metaheuristic Approach for the Vertex Coloring Problem
1
2.1 Introduction
1The results of this chapter appear in [84].
A Metaheuristic Approach for the Vertex Coloring Problem
2.1.1 The Heuristic Algorithm MMT
Introduction
S0
S0
S0
∅
S0
S0
2.1.2 Initialization Step
A Metaheuristic Approach for the Vertex Coloring Problem
∅
| |
:
- ∈
- \
:
- ∈
- \
and
- (
- )
∪ { }
- 1
- 1
0
0
••
∈
0
- 0
- 0
- 0
∈
- 0
- 0
- 0
- 0
∈
- 0
- 0
∈
••
2
2
2
PHASE 1: Evolutionary Algorithm
2
2
•
2
2
•
0
2
2
2
2.2 PHASE 1: Evolutionary Algorithm
2.2.1 Tabu Search Algorithm
•••
0
∈
0
0
A Metaheuristic Approach for the Vertex Coloring Problem
- {
- }
- 1
- +1
0
∈
|
∈
+1
0
|
+1
∈
+1
0
∈
0
- |
- |
+1
•••••
∗
