{"id":"W2005509629","doi":"10.1007/s10107-002-0370-6","title":"Approximating disjoint-path problems using packing integer programs","year":2004,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":81,"is_retracted":false,"has_abstract":false,"ca_institutions":"McMaster University","funders":"","keywords":"Disjoint sets; Mathematics; Bin packing problem; Combinatorics; Integer (computer science); Path (computing); Approximation algorithm; Packing problems; Vertex (graph theory); Integer programming; Discrete mathematics; Mathematical optimization; Algorithm; Computer science; Bin; Graph","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008101675,0.000344285,0.0004293181,0.0001417875,0.0004303191,0.0009362872,0.001012553,0.0001116295,0.00001264274],"category_scores_gemma":[0.0001986574,0.0002912682,0.0002304566,0.0009247177,0.0002191977,0.000752129,0.0006624851,0.0004358251,0.00005707399],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001336682,"about_ca_system_score_gemma":0.0000697381,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002992531,"about_ca_topic_score_gemma":0.00000441148,"domain_scores_codex":[0.9970406,0.00005979292,0.0007368347,0.0006489364,0.0006231989,0.0008905872],"domain_scores_gemma":[0.9986075,0.0001013361,0.0002392914,0.0007216014,0.0001048663,0.0002254464],"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.000001552446,0.000633675,0.0001253857,0.0004318662,0.00003690584,0.00003527872,0.003495879,0.0004330224,0.0002560095,0.6153402,0.000002029669,0.3792082],"study_design_scores_gemma":[0.0004969479,0.0001593604,0.000007923297,0.001177838,0.00002141257,0.0002311736,0.0006156147,0.3379313,0.0004482233,0.6577611,0.0005955417,0.0005535701],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01337527,0.0001029375,0.9833881,0.000392808,0.0001608065,0.0008411355,4.43202e-7,0.0008422073,0.0008963377],"genre_scores_gemma":[0.3314866,8.05484e-7,0.6682701,0.00005586886,0.00006552057,0.00008125153,0.000002331494,0.00002613095,0.00001141342],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3786546,"threshold_uncertainty_score":0.9999539,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05865507247347649,"score_gpt":0.2737072331314133,"score_spread":0.2150521606579368,"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."}}