{"id":"W1975508655","doi":"10.1109/focs.2013.67","title":"An LMP O(log n)-Approximation Algorithm for Node Weighted Prize Collecting Steiner Tree","year":2013,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Steiner tree problem; Combinatorics; Approximation algorithm; Mathematics; Undirected graph; Graph; Node (physics); Tree (set theory); Discrete mathematics; 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.001467343,0.001213203,0.001662124,0.0007238248,0.0007614078,0.001456962,0.002836134,0.001395416,0.007374051],"category_scores_gemma":[0.004034573,0.0005453832,0.0008327203,0.002074608,0.0006533138,0.002654433,0.001772564,0.001996726,0.001687906],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001997943,"about_ca_system_score_gemma":0.002733684,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00330146,"about_ca_topic_score_gemma":0.005251615,"domain_scores_codex":[0.9990386,0.0003005363,0.00004363697,0.0001918802,0.0002052319,0.000220263],"domain_scores_gemma":[0.9985824,0.0007496612,0.0001198917,0.0002868585,0.0001361338,0.0001251183],"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.00120644,0.0005701825,0.001474651,0.0005081058,0.0001093808,0.0002201821,0.0003290934,0.5708048,0.005212286,0.06289276,0.03926787,0.3174043],"study_design_scores_gemma":[0.0001174443,0.00006966577,0.0001703102,0.0000193979,0.00001638386,0.00009692968,0.00006085845,0.9628955,0.0008323931,0.03335739,0.002353354,0.00001038819],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07208511,0.00094615,0.9044339,0.002081785,0.0001968563,0.0003100004,0.0008292845,0.003142189,0.01597474],"genre_scores_gemma":[0.3373135,0.0003676972,0.6513128,0.0004596289,0.0001131162,0.0004363933,0.001436356,0.0004061662,0.008154284],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007374051,"threshold_uncertainty_score":0.02466863,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02558195332576888,"score_gpt":0.2619176437730184,"score_spread":0.2363356904472495,"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."}}