The stable set problem and the thinness of a graph

Operations Research Letters

Volumn 35, Issue 1, 2007, Pages 1-9

  Mannino, Carlo ^a   Oriolo, Gianpaolo ^a   Ricci, Federico ^a   Chandran, Sunil ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Frequency assignment; Pathwidth; Stable set; Thinness

Indexed keywords

ALGORITHMS; BENCHMARKING; GRAPH THEORY;

FREQUENCY ASSIGNMENT; INTERVAL GRAPHS; PATHWIDTH; STABLE SET;

PROBLEM SOLVING;

EID: 33750973640     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2006.01.009     Document Type: Article

References (12)

1. Aardal K., van Hoesel S.P.M., Koster A., Mannino C., and Sassano A. Models and solution techniques for frequency assignment problems. 4OR 4 1 (2003) 261-317
2. R.K. Ahuja, O. Ergun, J.B. Orlin, A.P. Punnen, A survey of very large-scale neighborhood search techniques, 〈http://web.mit.edu/jorlin/www/papersfolder/VLSN.pdf〉.
3. Bodlaender H. A tourist guide through treewidth. Acta Cybernet. 11 (1993) 1-21
4. Deineko V.G., and Woeginger G.J. A study of exponential neighborhoods for the travelling salesman problem and for the quadratic assignment problem. Math. Program. 87 A (2000) 519-542
5. A. Eisenblätter, A. Koster, FAP web-A website about frequency assignment problems, 〈http://fap.zib.de/〉.
6. Gupta U.I., Lee D.T., and Leung J.Y.T. Efficient algorithms for interval graphs and circular-arc graphs. Networks 12 (1982) 459-467
7. Hsiao J.Y., Tang C.Y., and Chang R. An efficient algorithm for finding a maximum weight 2-independent set on interval graphs. Information Process. Lett. 43 5 (1992) 229-235
8. A. Koster, Frequency assignment-models and algorithms, Ph.D. Thesis, Maastricht University, Netherlands 1999.
9. C. Mannino, G. Oriolo, F. Ricci, A short note on the implementation of a simulated annealing procedure for FAP, 〈http://www.dis.uniroma1.it/∼mannino/papers/SA_FAP.pdf〉.
10. Olariu S. An optimal greedy heuristic to color interval graphs. Inform. Process. Lett. 37 (1991) 21-25
11. Papadimitriou C., and Steiglitz K. Combinatorial Optimization (1982), Prentice-Hall, Englewood Cliffs, NJ
12. Ramalingam J., and Pandu Rangan C. A unified approach to domination problems on interval graphs. Inform. Process. Lett. 27 (1988) 271-274