{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003324158,0.003029613,0.003677151,0.002816103,0.00318263,0.008848188,0.006972906,0.004355146,0.01592575],"category_scores_gemma":[0.02500708,0.002547385,0.003746919,0.006911234,0.004709749,0.01890668,0.004863723,0.009685957,0.002363308],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003707545,"about_ca_system_score_gemma":0.002585922,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003179773,"about_ca_topic_score_gemma":0.004277278,"domain_scores_codex":[0.9951568,0.001448027,0.0002986556,0.0009545584,0.00135707,0.0007848914],"domain_scores_gemma":[0.9768372,0.0181119,0.001220941,0.002530946,0.0006650725,0.000633951],"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.002636412,0.001651014,0.005567324,0.0024623,0.0005791768,0.0005018717,0.001717694,0.4761073,0.005456358,0.2957479,0.04684493,0.1607278],"study_design_scores_gemma":[0.0003536881,0.0001807574,0.001313787,0.0001470108,0.0002468955,0.0004023713,0.0006381538,0.478265,0.002713007,0.5082874,0.00737928,0.00007258465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1672304,0.007328751,0.7647532,0.01128587,0.0005775776,0.0003755898,0.002443055,0.001567032,0.04443846],"genre_scores_gemma":[0.6175534,0.007798628,0.3406321,0.001994906,0.001680403,0.0007474419,0.006720613,0.001084601,0.02178794],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01592575,"threshold_uncertainty_score":0.0532769,"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."}}