{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002052064,0.002276688,0.001550574,0.001835834,0.0009163372,0.001776734,0.002572786,0.001929041,0.003920089],"category_scores_gemma":[0.005862536,0.0009903357,0.001229227,0.003941756,0.000949015,0.003768799,0.001967453,0.002740164,0.001091416],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00166983,"about_ca_system_score_gemma":0.00179936,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002397768,"about_ca_topic_score_gemma":0.003285726,"domain_scores_codex":[0.9983985,0.0005920774,0.00008278608,0.0003051174,0.0004712278,0.0001502908],"domain_scores_gemma":[0.9976801,0.001360238,0.0002094535,0.0003869934,0.0002306843,0.0001324837],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002795162,0.0003818801,0.0007414028,0.0003756711,0.0001277974,0.00008445082,0.0001836074,0.633697,0.002492825,0.07360381,0.009426702,0.2786054],"study_design_scores_gemma":[0.00008964175,0.0001108961,0.0002178192,0.00003358871,0.00003491867,0.00009674105,0.00003779939,0.9233484,0.001405605,0.06979767,0.004804391,0.00002257925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01341193,0.001143922,0.9780691,0.0003819593,0.00008168019,0.0001773444,0.0002466317,0.0008063,0.005681242],"genre_scores_gemma":[0.09495296,0.0007584892,0.8990476,0.0001883263,0.00009396362,0.0004390563,0.000817766,0.0002444368,0.003457507],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003920089,"threshold_uncertainty_score":0.01311398,"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."}}