{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008597439,0.0001525002,0.0002739064,0.001503883,0.0004619634,0.00003765751,0.001812462,0.0002528706,0.00003061918],"category_scores_gemma":[0.0001307409,0.0001726158,0.0001566307,0.002047099,0.0003772601,0.0003533711,0.0003400017,0.000548427,0.00002236414],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007755202,"about_ca_system_score_gemma":0.0001382295,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005320788,"about_ca_topic_score_gemma":0.00003218729,"domain_scores_codex":[0.9981045,0.00005241989,0.0001910304,0.0005376222,0.0005338631,0.0005805537],"domain_scores_gemma":[0.9984488,0.0001126515,0.0001137685,0.0008143144,0.0004072889,0.0001031247],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001064798,0.000607176,0.00008488381,0.0000504985,0.00005456775,0.0001080713,0.0002108711,0.0002631828,0.001683544,0.7724913,0.003553126,0.2207863],"study_design_scores_gemma":[0.002223733,0.004369976,0.0008575973,0.0001980381,0.0000188662,0.00003763851,0.0006991758,0.1597321,0.01524258,0.7986712,0.01747411,0.0004750082],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1540766,0.0003589501,0.8010649,0.0241967,0.0002461684,0.002601073,0.0001225191,0.00141451,0.01591857],"genre_scores_gemma":[0.8062323,0.00008988563,0.1923914,0.00005568846,0.0000288692,0.000003847389,0.00002743146,0.000009957589,0.001160638],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6521557,"threshold_uncertainty_score":0.7039067,"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."}}