{"id":"W1992520347","doi":"10.1145/1290672.1290684","title":"Packing element-disjoint steiner trees","year":2007,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta; University of Waterloo","funders":"","keywords":"Combinatorics; Steiner tree problem; Mathematics; Linear programming relaxation; Disjoint sets; Upper and lower bounds; Packing problems; Matching (statistics); Terminal and nonterminal symbols; Approximation algorithm; Discrete mathematics; Linear programming; Binary logarithm; Algorithm; 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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006362072,0.0002699292,0.0002260349,0.0004055619,0.0004850163,0.0001826978,0.001397374,0.00009689166,0.0001840456],"category_scores_gemma":[0.00002268883,0.0002575591,0.0002261526,0.0009366489,0.0000953016,0.0005269711,0.00004364655,0.000404514,0.0001387648],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009069228,"about_ca_system_score_gemma":0.00004153751,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007785656,"about_ca_topic_score_gemma":0.0001708616,"domain_scores_codex":[0.9977654,0.00004974038,0.0004255024,0.0005864945,0.0005507487,0.0006221416],"domain_scores_gemma":[0.9979883,0.0002762855,0.00008763656,0.001346068,0.00009315831,0.0002085114],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001009106,0.0002815597,0.00002559457,0.000005755398,0.00005585969,0.00004086325,0.0004306989,0.0003922151,0.0003589168,0.006728322,0.0001135909,0.9915565],"study_design_scores_gemma":[0.009973897,0.003920115,0.03803163,0.0005230135,0.0002637472,0.0007219975,0.002854803,0.3140615,0.2066982,0.2091629,0.2077076,0.006080697],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001924504,0.0000793155,0.9930883,0.001544859,0.001161878,0.0001993243,0.00001343408,0.0004856276,0.001502758],"genre_scores_gemma":[0.45544,0.00005416652,0.542635,0.0008064366,0.0002073571,0.00002829058,0.00000458576,0.00002953528,0.000794624],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9854758,"threshold_uncertainty_score":0.9999877,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03228228936273474,"score_gpt":0.2810975838117912,"score_spread":0.2488152944490565,"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."}}