{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008629644,0.0003205324,0.0003805406,0.0004306459,0.0003125836,0.0004034313,0.001174964,0.0001700533,0.000004758913],"category_scores_gemma":[0.0003477107,0.000297615,0.0002299125,0.0006869148,0.00009112696,0.00158253,0.0002887,0.0003390176,0.00005982386],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001647071,"about_ca_system_score_gemma":0.0001471505,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002692738,"about_ca_topic_score_gemma":0.0001102048,"domain_scores_codex":[0.9974708,0.00003208332,0.0009319353,0.0003231339,0.0004607889,0.0007812426],"domain_scores_gemma":[0.9980289,0.0003139435,0.0002992842,0.0007846016,0.0003249448,0.00024834],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004205142,0.002394534,0.003936558,0.0008051949,0.0002293101,0.00001385312,0.03993687,0.03091107,0.00001220114,0.5959563,0.02007689,0.3053067],"study_design_scores_gemma":[0.003462967,0.000610637,0.0001381487,0.0001527439,0.00001190414,0.00001490896,0.000629033,0.832224,0.0001710558,0.02095348,0.1412064,0.0004247458],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01781513,0.00003731495,0.9757641,0.0007796359,0.001160499,0.001889843,0.0002460744,0.0003136203,0.001993807],"genre_scores_gemma":[0.1892961,0.00001225634,0.8075373,0.001005378,0.0002432999,0.0007851212,0.0004775437,0.00005074697,0.0005923324],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8013129,"threshold_uncertainty_score":0.9999476,"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."}}