Semi-definite positive programming relaxations for graph Kn-coloring in frequency assignment

RAIRO Recherche Operationnelle

Volumn 35, Issue 2, 2001, Pages 211-228

  Meurdesoif, P ^a   Rottembourg, B ^a  

^a INRIA RHÔNE ALPES   (France)

Author keywords

Discrete optimization; Frequency assignment; Graph coloring; Hypergraph coloring; Semidefinite programming

Indexed keywords

APPROXIMATION THEORY; COLORING; FREQUENCY HOPPING; GRAPH THEORY; OPTIMIZATION;

GRAPH COLORING; SEMI-DEFINITE POSITIVE PROGRAMMING;

OPERATIONS RESEARCH;

EID: 0035314672     PISSN: 03990559     EISSN: None     Source Type: Journal    
DOI: 10.1051/ro:2001112     Document Type: Article

References (10)

1. Zero knowledge and the chromatic number
2. Improved approximation algorithms for MAX k-cut and MAX bisection
3. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
4. Approximate graph coloring by semidefinite programming
5. Approximate coloring of uniform hypergraphs
6. On the Shannon capacity of a graph
7. On the hardness of approximating minimization problems
8. Derandomizing semidefinite programming based approximation algorithms