{"id":"https://openalex.org/W2018052030","doi":"https://doi.org/10.1051/ro:2001112","title":"Semi-Definite positive Programming Relaxations for Graph K<sub>n</sub>-Coloring in Frequency Assignment","display_name":"Semi-Definite positive Programming Relaxations for Graph K<sub>n</sub>-Coloring in Frequency Assignment","publication_year":2001,"publication_date":"2001-04-01","ids":{"openalex":"https://openalex.org/W2018052030","doi":"https://doi.org/10.1051/ro:2001112","mag":"2018052030"},"language":"en","primary_location":{"id":"doi:10.1051/ro:2001112","is_oa":false,"landing_page_url":"https://doi.org/10.1051/ro:2001112","pdf_url":null,"source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Operations Research","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5014408543","display_name":"Philippe Meurdesoif","orcid":null},"institutions":[{"id":"https://openalex.org/I4210101348","display_name":"Centre Inria de l'Universit\u00e9 Grenoble Alpes","ror":"https://ror.org/00n8d6z93","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1326498283","https://openalex.org/I4210101348"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Philippe Meurdesoif","raw_affiliation_strings":["Projet NUMOPT, INRIA Rh\u00f4ne-Alpes, 655 avenue de l'Europe, 38330 Montbonnot-Saint-Martin, France; Philippe.Meurdesoif@inrialpes.fr"],"affiliations":[{"raw_affiliation_string":"Projet NUMOPT, INRIA Rh\u00f4ne-Alpes, 655 avenue de l'Europe, 38330 Montbonnot-Saint-Martin, France; Philippe.Meurdesoif@inrialpes.fr","institution_ids":["https://openalex.org/I4210101348"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113871337","display_name":"Beno\u00eet Rottembourg","orcid":null},"institutions":[{"id":"https://openalex.org/I280199911","display_name":"Bouygues (France)","ror":"https://ror.org/056185y51","country_code":"FR","type":"company","lineage":["https://openalex.org/I280199911"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Beno\u00eet Rottembourg","raw_affiliation_strings":["Direction des Technologies Nouvelles, Bouygues, 1 avenue Eug\u00e8ne Freyssinet, 78061 Saint-Quentin-en-Yvelines, France; brottemb@challenger.bouygues.fr"],"affiliations":[{"raw_affiliation_string":"Direction des Technologies Nouvelles, Bouygues, 1 avenue Eug\u00e8ne Freyssinet, 78061 Saint-Quentin-en-Yvelines, France; brottemb@challenger.bouygues.fr","institution_ids":["https://openalex.org/I280199911"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5014408543"],"corresponding_institution_ids":["https://openalex.org/I4210101348"],"apc_list":null,"apc_paid":null,"fwci":0.4484,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.64251809,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"35","issue":"2","first_page":"211","last_page":"228"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9957000017166138,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9900000095367432,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/hypergraph","display_name":"Hypergraph","score":0.7654442191123962},{"id":"https://openalex.org/keywords/graph-coloring","display_name":"Graph coloring","score":0.6516569256782532},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5482760071754456},{"id":"https://openalex.org/keywords/fractional-coloring","display_name":"Fractional coloring","score":0.547599196434021},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5397710204124451},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5366055369377136},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.46074357628822327},{"id":"https://openalex.org/keywords/frequency-assignment","display_name":"Frequency assignment","score":0.4565455913543701},{"id":"https://openalex.org/keywords/list-coloring","display_name":"List coloring","score":0.447706937789917},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.43584805727005005},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.41316425800323486},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3857971727848053},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.35590410232543945},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.13619452714920044},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.10903814435005188}],"concepts":[{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.7654442191123962},{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.6516569256782532},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5482760071754456},{"id":"https://openalex.org/C158319403","wikidata":"https://www.wikidata.org/wiki/Q5477527","display_name":"Fractional coloring","level":5,"score":0.547599196434021},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5397710204124451},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5366055369377136},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.46074357628822327},{"id":"https://openalex.org/C2776628324","wikidata":"https://www.wikidata.org/wiki/Q22222748","display_name":"Frequency assignment","level":2,"score":0.4565455913543701},{"id":"https://openalex.org/C199594403","wikidata":"https://www.wikidata.org/wiki/Q1130404","display_name":"List coloring","level":5,"score":0.447706937789917},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.43584805727005005},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.41316425800323486},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3857971727848053},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.35590410232543945},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.13619452714920044},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.10903814435005188},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1051/ro:2001112","is_oa":false,"landing_page_url":"https://doi.org/10.1051/ro:2001112","pdf_url":null,"source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Operations Research","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1483204526","https://openalex.org/W1985123706","https://openalex.org/W2059453880","https://openalex.org/W2069816168","https://openalex.org/W2078289947","https://openalex.org/W2117158270","https://openalex.org/W2130857672","https://openalex.org/W2164744913","https://openalex.org/W2528429521"],"related_works":["https://openalex.org/W4291316360","https://openalex.org/W2793500002","https://openalex.org/W4297911588","https://openalex.org/W4311345810","https://openalex.org/W1995859989","https://openalex.org/W149461665","https://openalex.org/W3169197204","https://openalex.org/W2380525562","https://openalex.org/W4385455827","https://openalex.org/W2046652778"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3,18],"will":[4,41],"describe":[5],"a":[6,32,38,64,82],"new":[7],"class":[8],"of":[9,24,27,35,37,66,69],"coloring":[10],"problems,":[11,60],"arising":[12],"from":[13],"military":[14],"frequency":[15],"assignment,":[16],"where":[17],"want":[19],"to":[20,30,55,76],"minimize":[21],"the":[22,67],"number":[23],"distinct":[25],"n-uples":[26],"colors":[28],"used":[29],"color":[31],"given":[33],"set":[34],"n-complete-subgraphs":[36],"graph.":[39],"We":[40],"propose":[42],"two":[43],"relaxations":[44],"based":[45],"on":[46],"Semi-Definite":[47],"Programming":[48],"models":[49],"for":[50,73],"graph":[51],"and":[52],"hypergraph":[53,74],"coloring,":[54,75],"approximate":[56],"those":[57],"(generally)":[58],"NP-hard":[59],"as":[61,63],"well":[62],"generalization":[65],"works":[68],"Karger":[70],"et":[71],"al.":[72],"find":[77],"good":[78],"feasible":[79],"solutions":[80],"with":[81],"probabilistic":[83],"approach.":[84]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}