{"id":"W2035099047","doi":"10.1109/focs.2011.30","title":"Maximum Edge-Disjoint Paths in Planar Graphs with Congestion 2","year":2011,"lang":"en","type":"article","venue":"","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University; Royal Military College Saint-Jean","funders":"","keywords":"Disjoint sets; Logarithm; Computer science; Linear programming relaxation; Constant (computer programming); Network congestion; Approximation algorithm; Combinatorics; Steiner tree problem; Cluster analysis; Mathematics; Discrete mathematics; Linear programming; Algorithm; Computer network; Network packet","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.0006501569,0.0009140104,0.0008233948,0.0008686967,0.0007485386,0.001059622,0.001231365,0.001027651,0.00308206],"category_scores_gemma":[0.004576492,0.0006711751,0.0007467406,0.001920196,0.0009739988,0.002971041,0.001777529,0.001407242,0.0003142255],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001399822,"about_ca_system_score_gemma":0.0006236617,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00250689,"about_ca_topic_score_gemma":0.002139227,"domain_scores_codex":[0.9993656,0.00020726,0.00002156758,0.0001487106,0.0001219021,0.0001349359],"domain_scores_gemma":[0.9981397,0.001306179,0.0002640866,0.00009993139,0.00009029314,0.00009974087],"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.0002706751,0.0001167019,0.0008560104,0.0004291707,0.00007135382,0.0003518892,0.0003322604,0.7562488,0.005415064,0.1948917,0.004625435,0.03639089],"study_design_scores_gemma":[0.0001055852,0.0001369048,0.0007711685,0.00003930168,0.00005421578,0.0003188381,0.000253946,0.7138272,0.003363333,0.2698013,0.01129765,0.00003047385],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2795497,0.001801931,0.6966133,0.002088667,0.0000602461,0.0002714568,0.0006473447,0.0006354732,0.01833183],"genre_scores_gemma":[0.7531393,0.002252126,0.2336231,0.0002830883,0.0001253537,0.0002516787,0.0009264887,0.0002031693,0.009195624],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00308206,"threshold_uncertainty_score":0.01031053,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03368651481046178,"score_gpt":0.2538789957105406,"score_spread":0.2201924809000788,"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."}}