{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002199297,0.001800108,0.002185839,0.001825357,0.0009319551,0.003349136,0.00247736,0.002049816,0.007081305],"category_scores_gemma":[0.0151786,0.001304174,0.001488001,0.003632956,0.001168211,0.008684224,0.00238716,0.003566096,0.0008050535],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002228769,"about_ca_system_score_gemma":0.00161413,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002982309,"about_ca_topic_score_gemma":0.004472892,"domain_scores_codex":[0.9980078,0.0006947898,0.00009157098,0.0003315426,0.0005284661,0.0003457834],"domain_scores_gemma":[0.9912845,0.006932795,0.0005267375,0.000711725,0.0003072445,0.0002370599],"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.0004536496,0.000469961,0.001639068,0.0002974857,0.0000803123,0.00008265262,0.0001709166,0.7905889,0.001352103,0.0895649,0.006372939,0.1089271],"study_design_scores_gemma":[0.00003089202,0.00004266788,0.0001138993,0.00001616009,0.00001735538,0.00002674081,0.0000433862,0.9333862,0.0006011259,0.06467263,0.001043329,0.000005640134],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1294774,0.001473473,0.8473102,0.00142149,0.0001808645,0.0001747325,0.0004493527,0.001261897,0.01825047],"genre_scores_gemma":[0.4364617,0.001074938,0.5536785,0.0002805067,0.0001861544,0.0003227593,0.001094161,0.0004908002,0.006410656],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007081305,"threshold_uncertainty_score":0.02368933,"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."}}