{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003166312,0.001846341,0.002727962,0.001403992,0.002100443,0.004567046,0.007198558,0.002828214,0.01636009],"category_scores_gemma":[0.01253487,0.0007964164,0.002234568,0.002954427,0.00208922,0.00789817,0.004802354,0.005546528,0.002859952],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006005759,"about_ca_system_score_gemma":0.008106702,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00656074,"about_ca_topic_score_gemma":0.01158144,"domain_scores_codex":[0.9957455,0.0008276187,0.0001969184,0.00104227,0.001165819,0.001021916],"domain_scores_gemma":[0.9907883,0.004600028,0.0004404731,0.002773916,0.0007470894,0.0006502784],"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.002919156,0.001310175,0.002177966,0.001037662,0.000238641,0.0001565316,0.0006069049,0.4571638,0.01869208,0.2006899,0.04225717,0.2727499],"study_design_scores_gemma":[0.000156692,0.00009809315,0.0002551728,0.00002912243,0.00007494663,0.00008283203,0.00009766275,0.8914313,0.002521659,0.1026582,0.002570969,0.00002338683],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03627114,0.0004929389,0.9456272,0.001458468,0.0002346184,0.0002918489,0.0009647083,0.003231254,0.01142775],"genre_scores_gemma":[0.4016629,0.0004355519,0.5826999,0.0007237856,0.0002965735,0.0005482325,0.002006224,0.0009305466,0.01069625],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01636009,"threshold_uncertainty_score":0.05472988,"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."}}