{"id":"W2126874118","doi":"10.1145/2532645","title":"A logarithmic approximation for unsplittable flow on line graphs","year":2014,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta; University of Waterloo","funders":"Seventh Framework Programme; Natural Sciences and Engineering Research Council of Canada","keywords":"Rounding; Mathematics; Bounded function; Approximation algorithm; Bottleneck; Multiplicative function; Combinatorics; Logarithm; Time complexity; Discrete mathematics; Linear programming; Maximum flow problem; Mathematical optimization; Computer science","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.001554776,0.002273964,0.001759654,0.001077072,0.001111317,0.003014952,0.00332975,0.001871192,0.01197787],"category_scores_gemma":[0.006802588,0.0008044358,0.001196461,0.002317982,0.001294945,0.007257361,0.001930501,0.003455723,0.00228511],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003644349,"about_ca_system_score_gemma":0.002133887,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004853167,"about_ca_topic_score_gemma":0.005555325,"domain_scores_codex":[0.9982617,0.0004537855,0.00005265418,0.0003880345,0.0002883056,0.0005554957],"domain_scores_gemma":[0.9965183,0.002228468,0.0003432836,0.0004714818,0.0001740906,0.0002644654],"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.001480644,0.0007421385,0.001225271,0.0006062225,0.0001012489,0.0002926649,0.0003358299,0.7996597,0.005415522,0.06045847,0.02787041,0.1018118],"study_design_scores_gemma":[0.000137882,0.0001187316,0.0001746704,0.00003347118,0.00001833837,0.00009562745,0.00008304534,0.915332,0.001019669,0.07908563,0.003885288,0.00001565028],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1589137,0.002288444,0.7901194,0.005308213,0.0003268725,0.0004494365,0.002719698,0.007903107,0.03197106],"genre_scores_gemma":[0.5942974,0.001159719,0.3830407,0.001438954,0.0002664988,0.0004209216,0.004328027,0.0014501,0.01359771],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01197787,"threshold_uncertainty_score":0.04007,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03811854143595254,"score_gpt":0.2740565768001746,"score_spread":0.235938035364222,"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."}}