{"id":"W3134117472","doi":"10.1007/978-3-030-68211-8_22","title":"APX-Hardness and Approximation for the k-Burning Number Problem","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Combinatorics; APX; Generalization; Approximation algorithm; Running time; Graph; Mathematics; Sequence (biology); Binary logarithm; Discrete mathematics; Physics; Algorithm; Chemistry; Mathematical analysis","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.003006355,0.00253798,0.003773532,0.001517754,0.003211673,0.007237812,0.00783291,0.004446839,0.02749172],"category_scores_gemma":[0.01847274,0.001593323,0.003679713,0.004565056,0.004354796,0.02068919,0.006747539,0.01466996,0.004479351],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004352841,"about_ca_system_score_gemma":0.003143066,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003036403,"about_ca_topic_score_gemma":0.002570568,"domain_scores_codex":[0.996421,0.0008850563,0.0001874598,0.0009976217,0.0009028293,0.0006061147],"domain_scores_gemma":[0.984486,0.01120992,0.000688598,0.002373392,0.0005685675,0.0006735854],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001764411,0.0005870998,0.001842762,0.001854147,0.0002598809,0.0003076193,0.0006679375,0.1140355,0.00318679,0.6640123,0.09149383,0.1199878],"study_design_scores_gemma":[0.000126733,0.00005692673,0.0004074898,0.00008591296,0.00005852802,0.0002105071,0.0001262368,0.09250974,0.0008264533,0.897949,0.007612563,0.00002981262],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1308738,0.008258182,0.6564825,0.02903606,0.002082435,0.0006225253,0.007616018,0.003397862,0.1616307],"genre_scores_gemma":[0.5732127,0.006856293,0.297585,0.004726211,0.003284538,0.001687135,0.008419402,0.002296622,0.1019321],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02749172,"threshold_uncertainty_score":0.09196895,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01519672817404732,"score_gpt":0.2623620611385883,"score_spread":0.247165332964541,"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."}}