{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T23:58:08Z","timestamp":1648943888294},"reference-count":10,"publisher":"EDP Sciences","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"published-print":{"date-parts":[[2001,4]]},"DOI":"10.1051\/ro:2001112","type":"journal-article","created":{"date-parts":[[2003,11,19]],"date-time":"2003-11-19T08:43:48Z","timestamp":1069231428000},"page":"211-228","source":"Crossref","is-referenced-by-count":1,"title":["Semi-Definite positive Programming Relaxations for Graph K<sub>n<\/sub>-Coloring in Frequency Assignment"],"prefix":"10.1051","volume":"35","author":[{"given":"Philippe","family":"Meurdesoif","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Beno\u00eet","family":"Rottembourg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2002,8,15]]},"reference":[{"key":"R1","unstructured":"F. Alizadeh, J.-P. Haeberly, M.V. Nayakkankuppam and M.L. Overton,SDPPack User's Guide, version 0.8 beta. Technical report, NYU Computer Science Dept. (1997) 30 p. URL: http:\/\/www.cs.nyu.edu\/phd_students\/madhu\/sdppack\/sdppack.html"},{"key":"R2","unstructured":"T. Defaix,Optimisation stochastique et allocation de plans de fr\u00e9quences pour des r\u00e9seaux \u00e0 \u00e9vasion de fr\u00e9quences. Th\u00e8se de doctorat, Universit\u00e9 de Rennes 1 (1996) 175 p."},{"key":"R3","doi-asserted-by":"crossref","unstructured":"U. Feige and J. Kilian, Zero Knowledge and the Chromatic Number, inProc. of the 11th Annual IEEE Conference in Computing Complexity, Preliminary Version (1996) 278-287.","DOI":"10.1109\/CCC.1996.507690"},{"key":"R4","doi-asserted-by":"crossref","unstructured":"A. Frieze and M. Jerrum, Improved approximation algorithms for MAXk-cut and MAX BISECTION, inProc. of the Fourth MPS Conference on Integer Programming and Combinatorial Optimization. Springer-Verlag (1995) Paper Version: 21 p.","DOI":"10.1007\/3-540-59408-6_37"},{"key":"R5","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"Goemans","year":"1995","journal-title":"J. ACM"},{"key":"R6","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1145\/274787.274791","volume":"45","author":"Karger","year":"1998","journal-title":"J. ACM"},{"key":"R7","unstructured":"M. Krivelevich and B. Sudakov,Approximate coloring of uniform hypergraphs. DIMACS Technical Report 98-31 (1998) 15 p."},{"key":"R8","doi-asserted-by":"crossref","unstructured":"L. Lov\u00e1sz, On the Shannon capacity of a graph.IEEE Trans. Inform. TheoryIT-25(1979) 1-7.","DOI":"10.1109\/TIT.1979.1055985"},{"key":"R9","doi-asserted-by":"crossref","first-page":"960","DOI":"10.1145\/185675.306789","volume":"41","author":"Lund","year":"1994","journal-title":"J. ACM"},{"key":"R10","doi-asserted-by":"crossref","unstructured":"S. Mahajan and H. Ramesh, Derandomizing semidefinite programming based approximation algorithms, inProc. of the 36th Annual IEEE Symposium on Foundations of Computer Science(1995) Paper Version: 19 p.","DOI":"10.1109\/SFCS.1995.492473"}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro:2001112\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,27]],"date-time":"2020-03-27T02:49:08Z","timestamp":1585277348000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro:2001112"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,4]]},"references-count":10,"journal-issue":{"issue":"2"},"alternative-id":["autrans2000"],"URL":"https:\/\/doi.org\/10.1051\/ro:2001112","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001,4]]}}}