{"id":"W2180689556","doi":"10.1007/s00453-011-9540-3","title":"Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs","year":2011,"lang":"en","type":"article","venue":"Algorithmica","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Steiner tree problem; Combinatorics; Disjoint sets; Planar graph; Mathematics; Approximation algorithm; Discrete mathematics; 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002907424,0.0001830739,0.0002119677,0.0002090294,0.0000450986,0.00002896238,0.0001127567,0.000106316,0.000005534758],"category_scores_gemma":[0.00001982319,0.0001768301,0.00004578249,0.0001554274,0.00003120848,0.0002004036,0.00001714741,0.0001129704,0.000002597385],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003691393,"about_ca_system_score_gemma":0.000006686973,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006332905,"about_ca_topic_score_gemma":0.00003910264,"domain_scores_codex":[0.9989861,0.00001967493,0.0003473578,0.0002449082,0.0001069819,0.0002950282],"domain_scores_gemma":[0.9996353,0.00003719557,0.00004584531,0.0001879974,0.00003268461,0.0000610161],"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.0002527129,0.0002920486,0.001038874,0.0004198598,0.0002518567,0.00005741125,0.009376421,0.0001257467,0.02609054,0.009364454,0.0119716,0.9407585],"study_design_scores_gemma":[0.007415811,0.0009235389,0.01574159,0.0004934729,0.0001307977,0.0000518515,0.001499716,0.5737147,0.329177,0.05920785,0.009550546,0.002093141],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06507426,0.000918019,0.92162,0.0001395006,0.0006761128,0.002342043,0.0003958926,0.00168973,0.007144416],"genre_scores_gemma":[0.8589651,0.000133033,0.1402403,0.00003285516,0.0000937256,0.0002952659,0.0001119301,0.00005841042,0.00006935612],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9386653,"threshold_uncertainty_score":0.7210922,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0302688887740873,"score_gpt":0.228785167440798,"score_spread":0.1985162786667107,"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."}}