{"id":"W2137804648","doi":"10.1287/ijoc.2013.0589","title":"Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem","year":2014,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal","funders":"Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro","keywords":"Dominating set; Connected dominating set; Cardinality (data modeling); Algorithm; Mathematics; Branch and cut; Set (abstract data type); Branch and bound; Benders' decomposition; Strongly connected component; Graph; Mathematical optimization; Combinatorics; Computer science; Integer programming; Minimum spanning tree; Vertex (graph theory)","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.002413242,0.0001905817,0.0002244395,0.0001978414,0.001305929,0.0006910145,0.0006375012,0.00003990277,0.000001678274],"category_scores_gemma":[0.0003343005,0.0001260912,0.0000781806,0.0002340065,0.0001369454,0.0006650307,0.000296965,0.0004837651,0.000002618883],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004413437,"about_ca_system_score_gemma":0.00004446911,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002235309,"about_ca_topic_score_gemma":0.000001281163,"domain_scores_codex":[0.9983235,0.00009548725,0.0004643711,0.000263676,0.0003542933,0.000498646],"domain_scores_gemma":[0.9960949,0.002883906,0.0003286263,0.0002419139,0.0002677812,0.0001828974],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007232458,0.00002290767,0.0003940295,0.00005455132,0.00008511452,0.000008692115,0.001983193,0.006948365,0.0003482403,0.0560242,0.0002722084,0.9337862],"study_design_scores_gemma":[0.001685574,0.000476772,0.0009454217,0.0001617984,0.000009257009,0.001111118,0.0001854061,0.9120595,0.001114505,0.08037053,0.001630824,0.0002492645],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1367178,0.00009346209,0.8609985,0.001339589,0.0002280568,0.0003144755,0.000002233797,0.00006224112,0.0002437321],"genre_scores_gemma":[0.9170832,0.00002095409,0.08188727,0.0007466581,0.0002213644,0.000006526858,0.000001794007,0.00001495441,0.00001728073],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9335369,"threshold_uncertainty_score":0.9999942,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02272631946703941,"score_gpt":0.3144781079620658,"score_spread":0.2917517884950264,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}