{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063624,0.0009501966,0.002035804,0.0008327945,0.000871489,0.001499927,0.001742393,0.001785923,0.006784866],"category_scores_gemma":[0.005303022,0.000880738,0.0009217621,0.002453231,0.0007084119,0.004312153,0.002874009,0.001413607,0.00153947],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005967763,"about_ca_system_score_gemma":0.0006197282,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006721372,"about_ca_topic_score_gemma":0.0009874951,"domain_scores_codex":[0.9984373,0.0003561733,0.0001515892,0.0004436017,0.0003254238,0.0002858499],"domain_scores_gemma":[0.9975669,0.001019516,0.000315136,0.0007288801,0.0001439093,0.0002257003],"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.002179964,0.0007516471,0.004485344,0.0008832688,0.0002728903,0.001582411,0.000825709,0.5638075,0.04269769,0.09296226,0.021435,0.2681164],"study_design_scores_gemma":[0.0001472693,0.0004226331,0.00111205,0.00006696256,0.0000849096,0.0009130156,0.0003322941,0.8516328,0.01731118,0.1163732,0.01156551,0.00003815542],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2951383,0.001019838,0.6829026,0.001092716,0.0002055907,0.0002530811,0.001624166,0.001945457,0.01581817],"genre_scores_gemma":[0.5402731,0.0008406709,0.4477778,0.0002724896,0.00009376676,0.0001841606,0.003737019,0.0002681167,0.006552846],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006784866,"threshold_uncertainty_score":0.02269763,"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."}}