{"id":"W3025998413","doi":"10.1109/pdp50117.2020.00046","title":"Heuristic Algorithms with Near Optimal Broadcasting in Cactus Graphs","year":2020,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Chordal graph; Heuristics; Vertex (graph theory); Maximal independent set; Clique problem; Heuristic; Feedback vertex set; Indifference graph; Steiner tree problem; Broadcasting (networking); Clique-sum; Pathwidth; Theoretical computer science; Algorithm; Combinatorics; Graph; Mathematics; 1-planar graph; Computer network; Line graph","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.0007053872,0.0009749244,0.0009774314,0.001343582,0.001075057,0.001221505,0.001764955,0.001498618,0.003199378],"category_scores_gemma":[0.004983688,0.0006749086,0.0006579135,0.002309093,0.0009064867,0.001287887,0.0009225348,0.0009112787,0.0004495841],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002173484,"about_ca_system_score_gemma":0.002409962,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009633543,"about_ca_topic_score_gemma":0.009796999,"domain_scores_codex":[0.9993351,0.000193197,0.00003516108,0.0001331506,0.0001150006,0.0001884051],"domain_scores_gemma":[0.9978198,0.001436677,0.0002166336,0.0002381967,0.0001534248,0.0001353451],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003733642,0.0002239716,0.001104917,0.0002747758,0.00006428042,0.0001966675,0.0002844197,0.8763599,0.003092145,0.02672954,0.005455697,0.08584038],"study_design_scores_gemma":[0.0001312949,0.00006732558,0.0002031243,0.00002384807,0.00002155457,0.00008225776,0.0001033379,0.9743808,0.001387868,0.02142804,0.002157659,0.0000129155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3419873,0.001998384,0.623749,0.001097163,0.0001383341,0.0008412657,0.0006350278,0.002999421,0.02655417],"genre_scores_gemma":[0.6498229,0.000675839,0.3446842,0.000245985,0.00005563521,0.0004603534,0.0009558852,0.0002024585,0.002896817],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009633543,"threshold_uncertainty_score":0.01915491,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0158259185227941,"score_gpt":0.2196577670070545,"score_spread":0.2038318484842604,"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."}}