{"id":"W3013656193","doi":"10.1007/s00453-022-00972-6","title":"Asymptotic Quasi-Polynomial Time Approximation Scheme for Resource Minimization for Fire Containment","year":2022,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Rounding; Linear programming relaxation; Theory of computation; Combinatorics; Randomized rounding; Approximation algorithm; Vertex (graph theory); Binary logarithm; Time complexity; Mathematics; Minification; Linear programming; Steiner tree problem; Polynomial-time approximation scheme; Tree (set theory); Discrete mathematics; Running time; Graph; Computer science; Mathematical optimization; Algorithm","routes":{"ca_aff":true,"ca_fund":true,"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":[],"consensus_categories":[],"category_scores_codex":[0.0004926285,0.000180868,0.000231103,0.0001165462,0.000828469,0.0001307575,0.0008344679,0.00005340364,0.00005095021],"category_scores_gemma":[0.00007316404,0.0002075176,0.0001769236,0.0003483839,0.00004643622,0.0002453103,0.0003628474,0.0001261345,0.00001045567],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001797528,"about_ca_system_score_gemma":0.00009079654,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007813062,"about_ca_topic_score_gemma":5.394343e-7,"domain_scores_codex":[0.9982854,0.00009061118,0.0003476836,0.0005395805,0.0003522317,0.000384492],"domain_scores_gemma":[0.9988186,0.0003666673,0.0001786905,0.0004679008,0.00008402907,0.00008408699],"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.0003130083,0.001373083,0.00002536822,0.0001538792,0.0002175658,0.000006444032,0.002684222,0.002958219,0.001267338,0.09241436,0.1210785,0.777508],"study_design_scores_gemma":[0.001175188,0.0005596405,0.0000186086,0.000006754557,0.00001399477,0.00001191292,0.0000869351,0.8614079,0.0006746474,0.005956976,0.1298446,0.0002428785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001542565,0.00008945093,0.9932057,0.002664688,0.0004708175,0.001430445,0.0001366509,0.0002246417,0.0002350831],"genre_scores_gemma":[0.03581464,0.000002674245,0.9577994,0.001146102,0.000595263,0.00217177,0.0005776376,0.00005170676,0.001840761],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8584496,"threshold_uncertainty_score":0.8462324,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01457112964428874,"score_gpt":0.233886044052812,"score_spread":0.2193149144085233,"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."}}