{"id":"https://openalex.org/W4283732291","doi":"https://doi.org/10.1109/codit55151.2022.9803882","title":"The Labeled Two Edge Connected Subgraph Problem","display_name":"The Labeled Two Edge Connected Subgraph Problem","publication_year":2022,"publication_date":"2022-05-17","ids":{"openalex":"https://openalex.org/W4283732291","doi":"https://doi.org/10.1109/codit55151.2022.9803882"},"language":"en","primary_location":{"id":"doi:10.1109/codit55151.2022.9803882","is_oa":false,"landing_page_url":"https://doi.org/10.1109/codit55151.2022.9803882","pdf_url":null,"source":{"id":"https://openalex.org/S4363607900","display_name":"2022 8th International Conference on Control, Decision and Information Technologies (CoDIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 8th International Conference on Control, Decision and Information Technologies (CoDIT)","raw_type":"proceedings-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/A5110757530","display_name":"M. Ben Salem","orcid":null},"institutions":[{"id":"https://openalex.org/I142899784","display_name":"University of Sfax","ror":"https://ror.org/04d4sd432","country_code":"TN","type":"education","lineage":["https://openalex.org/I142899784"]}],"countries":["TN"],"is_corresponding":false,"raw_author_name":"Mariem Ben Salem","raw_affiliation_strings":["Universit&#x00E9; de Sfax,FSEGS/MIRACL,Tunisia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit&#x00E9; de Sfax,FSEGS/MIRACL,Tunisia","institution_ids":["https://openalex.org/I142899784"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087382959","display_name":"Raouia Taktak","orcid":null},"institutions":[{"id":"https://openalex.org/I4210119561","display_name":"Digital Research Centre of Sfax","ror":"https://ror.org/02s48dm85","country_code":"TN","type":"facility","lineage":["https://openalex.org/I4210119561"]}],"countries":["TN"],"is_corresponding":false,"raw_author_name":"Raouia Taktak","raw_affiliation_strings":["Universit&#x00E9; de Sfax,ISIMS &#x0026; Sm@rts/CRNS,Tunisia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit&#x00E9; de Sfax,ISIMS &#x0026; Sm@rts/CRNS,Tunisia","institution_ids":["https://openalex.org/I4210119561"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2597,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.34857143,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1020","last_page":"1025"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9945999979972839,"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.9945999979972839,"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.9941999912261963,"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.9527000188827515,"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/integer-programming","display_name":"Integer programming","score":0.6457107067108154},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.6050337553024292},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5882022976875305},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5099793672561646},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5070033073425293},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5066055059432983},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4998209476470947},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.49469873309135437},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4230676293373108},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3886696994304657},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3705516457557678},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.23978734016418457},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.23240864276885986},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.061731427907943726}],"concepts":[{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.6457107067108154},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.6050337553024292},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5882022976875305},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5099793672561646},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5070033073425293},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5066055059432983},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4998209476470947},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.49469873309135437},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4230676293373108},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3886696994304657},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3705516457557678},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23978734016418457},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.23240864276885986},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.061731427907943726},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/codit55151.2022.9803882","is_oa":false,"landing_page_url":"https://doi.org/10.1109/codit55151.2022.9803882","pdf_url":null,"source":{"id":"https://openalex.org/S4363607900","display_name":"2022 8th International Conference on Control, Decision and Information Technologies (CoDIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 8th International Conference on Control, Decision and Information Technologies (CoDIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W31709568","https://openalex.org/W131006777","https://openalex.org/W164111053","https://openalex.org/W201114412","https://openalex.org/W1579870444","https://openalex.org/W1975457241","https://openalex.org/W2012939571","https://openalex.org/W2022641305","https://openalex.org/W2048177396","https://openalex.org/W2051100691","https://openalex.org/W2065297120","https://openalex.org/W2089581733","https://openalex.org/W2089731376","https://openalex.org/W2139317321","https://openalex.org/W2150855695","https://openalex.org/W2158280079","https://openalex.org/W2497096145","https://openalex.org/W2516171751","https://openalex.org/W2604916921","https://openalex.org/W2806976001","https://openalex.org/W2895324310","https://openalex.org/W2919730811","https://openalex.org/W2964140139","https://openalex.org/W3029888609","https://openalex.org/W4211176206","https://openalex.org/W4213060883","https://openalex.org/W4236709137","https://openalex.org/W4392217259"],"related_works":["https://openalex.org/W1925942709","https://openalex.org/W2047683846","https://openalex.org/W2044902158","https://openalex.org/W2082154838","https://openalex.org/W2109912052","https://openalex.org/W1711527768","https://openalex.org/W4285278887","https://openalex.org/W2995925505","https://openalex.org/W2365237642","https://openalex.org/W3116484972"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,148],"address":[4],"a":[5,35,53,63,150],"variant":[6,110],"of":[7,58,66,75,153],"the":[8,16,22,27,48,76,78,92,95,113,121,145],"Two":[9,29,116],"Edge":[10,30,117],"Connected":[11,31,118],"Problem":[12,32,119],"(TECP),":[13],"that":[14],"is":[15,81,85,97,111],"TECP":[17],"with":[18,62,87,104],"color":[19],"constraint":[20],"on":[21],"edges,":[23],"also":[24],"known":[25],"as":[26,132],"Labeled":[28,115],"(LTECP).":[33],"Given":[34],"connected":[36,55],"undirected":[37],"graph":[38],"<tex":[39,59],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[40,60],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$G$</tex>":[41,61],"whose":[42],"edges":[43],"are":[44,125],"labeled":[45],"(or":[46,69],"colored),":[47],"LTECP":[49],"consists":[50],"in":[51,127],"finding":[52],"two-edge":[54],"spanning":[56],"subgraph":[57],"minimum":[64],"number":[65],"distinct":[67],"labels":[68],"colors).":[70],"We":[71,138],"distinguish":[72],"two":[73,146],"variants":[74],"problem:":[77],"first":[79],"one":[80,89,107],"when":[82,98],"each":[83,99],"edge":[84,100],"associated":[86,103],"exactly":[88],"label":[90],"(i.e.,":[91,120],"LTECP),":[93],"and":[94,156],"second":[96],"may":[101],"be":[102],"more":[105],"than":[106],"label.":[108],"This":[109],"called":[112],"Generalized":[114],"GLTECP).":[122],"Both":[123],"problems":[124],"relevant":[126],"some":[128],"application":[129],"fields":[130],"such":[131],"telecommunication":[133],"networks":[134],"or":[135],"transportation":[136],"networks.":[137],"propose":[139],"Integer":[140],"Linear":[141],"Programming":[142],"formulations":[143],"for":[144],"variants,":[147],"identify":[149],"new":[151],"class":[152],"valid":[154],"inequalities,":[155],"present":[157],"preliminary":[158],"computational":[159],"results.":[160]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}