{"id":"W2624136382","doi":"10.1145/1240233.1240246","title":"Sharing the cost more efficiently","year":2007,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Steiner tree problem; Minimum-cost flow problem; Approximation algorithm; Mathematical optimization; Mathematics; Computer science; Provisioning; Flow network; Combinatorics; Discrete mathematics; Computer network","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.001582797,0.002220857,0.002474262,0.001078101,0.00135928,0.004418022,0.003129049,0.001881889,0.04524464],"category_scores_gemma":[0.007151072,0.0007223784,0.001341649,0.002531661,0.0008142192,0.008972271,0.002946673,0.00272917,0.006156171],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002908271,"about_ca_system_score_gemma":0.003671258,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005003576,"about_ca_topic_score_gemma":0.007976279,"domain_scores_codex":[0.9971175,0.0004505449,0.0001272628,0.0005612638,0.000855601,0.0008877883],"domain_scores_gemma":[0.997036,0.0008489652,0.0001528244,0.001535286,0.0002850385,0.0001418923],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0009928279,0.0009453234,0.001227373,0.0005430633,0.0002064364,0.0003570491,0.0003302845,0.3553851,0.01723237,0.1843236,0.03697922,0.4014773],"study_design_scores_gemma":[0.0002278759,0.0003369224,0.0006627822,0.00009246467,0.0001626129,0.0005726457,0.000364191,0.7681853,0.006997572,0.1796626,0.0426634,0.00007165055],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1408217,0.002050761,0.7387528,0.004164601,0.0008635765,0.0009548147,0.001021439,0.003128192,0.1082422],"genre_scores_gemma":[0.6391036,0.0009981303,0.312467,0.0008983237,0.0002184131,0.0004360725,0.0009399746,0.001108336,0.04383013],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.04524464,"threshold_uncertainty_score":0.1513584,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03576802905243455,"score_gpt":0.3094672376166355,"score_spread":0.2736992085642009,"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."}}