{"id":"W2108031738","doi":"10.5555/1496770.1496847","title":"A logarithmic approximation for unsplittable flow on line graphs","year":2009,"lang":"en","type":"article","venue":"TU/e Research Portal (Eindhoven University of Technology)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Rounding; Bounded function; Approximation algorithm; Mathematics; Bottleneck; Logarithm; Linear programming; Time complexity; Multiplicative function; Discrete mathematics; Mathematical optimization; Linear programming relaxation; Dynamic programming; Randomized rounding; Combinatorics; Maximum flow problem; Computer science","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.001551067,0.002360821,0.001739169,0.001100956,0.001141916,0.003027661,0.00338855,0.001853829,0.01263374],"category_scores_gemma":[0.006825274,0.00079551,0.001198328,0.002395405,0.001271751,0.007485331,0.001868584,0.003410487,0.002481784],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00381975,"about_ca_system_score_gemma":0.002221518,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005235118,"about_ca_topic_score_gemma":0.006093959,"domain_scores_codex":[0.9982262,0.0004586859,0.00005466516,0.0004039987,0.0002907399,0.0005657884],"domain_scores_gemma":[0.9965143,0.002229702,0.0003398612,0.0004745043,0.0001793152,0.0002623893],"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.001489819,0.0007634699,0.001222304,0.0006443381,0.000103637,0.0002838693,0.0003496712,0.7913257,0.005451707,0.05866424,0.03024806,0.1094532],"study_design_scores_gemma":[0.0001499024,0.0001261695,0.0001804317,0.00003750256,0.00001929248,0.0000997254,0.00009054954,0.9167208,0.001090766,0.07698578,0.004482466,0.0000165451],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.158215,0.002614939,0.7866206,0.005448636,0.000357653,0.0005021187,0.002995217,0.008958775,0.03428712],"genre_scores_gemma":[0.5843423,0.001245582,0.3920254,0.001488812,0.0002747564,0.0004528032,0.004666862,0.001533984,0.01396941],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01263374,"threshold_uncertainty_score":0.04226404,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0520818013227625,"score_gpt":0.3058116828637354,"score_spread":0.2537298815409729,"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."}}