{"id":"W2963443829","doi":"10.4230/lipics.icalp.2017.32","title":"Improved Algorithms for MST and Metric-TSP Interdiction","year":2017,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Defense, Military, and Policy Studies","field":"Economics, Econometrics and Finance","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Interdiction; Knapsack problem; Approximation algorithm; Mathematics; Metric (unit); Continuous knapsack problem; Greedy algorithm; Combinatorics; Tree (set theory); Upper and lower bounds; Generalization; Multigraph; Mathematical optimization; Computer science; 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.001503725,0.002163325,0.001811991,0.002061255,0.001049719,0.002283883,0.004762653,0.002422356,0.016531],"category_scores_gemma":[0.01031447,0.0009514259,0.002437268,0.004325187,0.001116715,0.006414249,0.004150235,0.004849465,0.004892902],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003258306,"about_ca_system_score_gemma":0.002423123,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004638386,"about_ca_topic_score_gemma":0.007550835,"domain_scores_codex":[0.9972384,0.0005257034,0.0001729774,0.0007270203,0.0009464588,0.0003894951],"domain_scores_gemma":[0.996276,0.001322168,0.0003191118,0.001309424,0.0005600713,0.0002132061],"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.0005646065,0.0004375028,0.001341161,0.0008664886,0.0002033348,0.0002109396,0.0004763649,0.488003,0.005822186,0.2119129,0.04195369,0.2482078],"study_design_scores_gemma":[0.00008630205,0.0001212382,0.0003466423,0.00007121912,0.00006735988,0.0002598309,0.00008069622,0.79246,0.002361642,0.1876043,0.01651021,0.00003049179],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01805366,0.001240763,0.9549519,0.001149256,0.0002055526,0.0001950905,0.0011958,0.003090644,0.01991728],"genre_scores_gemma":[0.2085139,0.00108702,0.7743768,0.0006863352,0.0002519444,0.0003330325,0.00366919,0.001331278,0.00975053],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.016531,"threshold_uncertainty_score":0.05530167,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05027572088194217,"score_gpt":0.2854075737397526,"score_spread":0.2351318528578104,"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."}}