{"id":"W2276905128","doi":"10.4230/lipics.approx-random.2015.265","title":"On Linear Programming Relaxations for Unsplittable Flow in Trees","year":2015,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo; University of Alberta","funders":"","keywords":"Mathematics; Combinatorics; Linear programming relaxation; Path (computing); Omega; Tree (set theory); Rank (graph theory); Upper and lower bounds; Relaxation (psychology); Linear programming; Approximation algorithm; Binary logarithm; Constant (computer programming); Time complexity; Discrete mathematics; Algorithm; Computer science; Physics","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.00406274,0.002901439,0.001647067,0.001540792,0.00134114,0.003109665,0.00184694,0.002180144,0.009520166],"category_scores_gemma":[0.01930558,0.001441469,0.002898659,0.003499938,0.002445613,0.006559295,0.002101633,0.009779396,0.00171739],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003514932,"about_ca_system_score_gemma":0.002036603,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005064487,"about_ca_topic_score_gemma":0.004700054,"domain_scores_codex":[0.9973931,0.001012253,0.00009544767,0.000429009,0.0005059878,0.0005640628],"domain_scores_gemma":[0.9873971,0.01054694,0.00078923,0.0004465619,0.0005062089,0.0003139348],"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.0003109475,0.0004655253,0.0007166918,0.0007445348,0.00009932622,0.0003633852,0.0006467316,0.6359535,0.003300115,0.2940954,0.01490519,0.04839859],"study_design_scores_gemma":[0.0000959067,0.0001397364,0.0003139131,0.0001698519,0.00004041026,0.000163523,0.0002238476,0.7365228,0.001182278,0.2491453,0.01196293,0.00003951264],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03637589,0.004154014,0.916285,0.004029172,0.000302311,0.000333575,0.0007370118,0.0005335691,0.03724958],"genre_scores_gemma":[0.2992717,0.007565728,0.6639916,0.002788044,0.001299062,0.001451416,0.002187449,0.001004383,0.02044062],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009520166,"threshold_uncertainty_score":0.03184813,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04474204562629377,"score_gpt":0.2913879659113839,"score_spread":0.2466459202850901,"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."}}