{"id":"W4237140089","doi":"10.1137/1.9781611973068.77","title":"A logarithmic approximation for unsplittable flow on line graphs","year":2009,"lang":"en","type":"article","venue":"Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bottleneck; Logarithm; Approximation algorithm; Bounded function; Mathematics; Time complexity; Computer science; Discrete mathematics; Combinatorics; 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.00148329,0.001997798,0.001524,0.001089568,0.001056996,0.002816753,0.002945962,0.001649611,0.01043745],"category_scores_gemma":[0.006281896,0.0007080852,0.001024225,0.002211553,0.001212387,0.00653128,0.001657039,0.002875779,0.001904167],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003735823,"about_ca_system_score_gemma":0.002029735,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005265436,"about_ca_topic_score_gemma":0.006078884,"domain_scores_codex":[0.9983618,0.000449037,0.00004862926,0.0003377977,0.0002793562,0.0005233531],"domain_scores_gemma":[0.9969855,0.001896411,0.0003142413,0.0004086482,0.0001666221,0.0002285374],"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.001314312,0.0006225761,0.001169668,0.0004484807,0.00008193444,0.0002437176,0.000289845,0.831351,0.005124887,0.04883453,0.01997865,0.09054042],"study_design_scores_gemma":[0.000109761,0.0001036605,0.0001559596,0.00002477713,0.00001348849,0.00007542117,0.00007008685,0.9398034,0.0009200569,0.05567462,0.003036127,0.00001266084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1699803,0.001986458,0.7831772,0.004365414,0.0002555233,0.0004264865,0.00223846,0.007696003,0.02987409],"genre_scores_gemma":[0.6293269,0.0009801091,0.3520992,0.001159678,0.0001953493,0.0003771764,0.003372729,0.001174514,0.01131423],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01043745,"threshold_uncertainty_score":0.03491676,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02003102456231295,"score_gpt":0.2649339222629797,"score_spread":0.2449028977006667,"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."}}