{"id":"W2142756199","doi":"10.1007/978-3-642-03685-9_1","title":"Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Steiner tree problem; Combinatorics; Disjoint sets; Planar graph; Approximation algorithm; Discrete mathematics; Mathematics; Cardinality (data modeling); Computer science; Graph; Algorithm","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.002565854,0.003378481,0.004120511,0.002704754,0.002782115,0.008635891,0.007828078,0.004401533,0.01756754],"category_scores_gemma":[0.01722529,0.002869236,0.004263199,0.008335703,0.003954348,0.01855506,0.004683171,0.01244244,0.003140802],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003815639,"about_ca_system_score_gemma":0.002071564,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002780835,"about_ca_topic_score_gemma":0.003105304,"domain_scores_codex":[0.9958775,0.0009738801,0.000256342,0.0008508914,0.001409211,0.000632236],"domain_scores_gemma":[0.9846676,0.01162565,0.0007005262,0.002014921,0.0005486516,0.0004426721],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002341275,0.001601793,0.00305869,0.003222337,0.0005663844,0.0005109672,0.00152022,0.3306369,0.007157389,0.3559782,0.06919861,0.2242073],"study_design_scores_gemma":[0.0003148751,0.0001678129,0.001174075,0.0001982646,0.0002403203,0.0005483406,0.0005187879,0.3406066,0.003007336,0.6411605,0.01198271,0.00008034057],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1313795,0.01280615,0.7615584,0.009655045,0.0008827194,0.0004794154,0.003401394,0.002187762,0.07764972],"genre_scores_gemma":[0.4702369,0.01350497,0.4635132,0.00191198,0.002312573,0.0009745667,0.009917064,0.001564029,0.03606476],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01756754,"threshold_uncertainty_score":0.05876929,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01794846320699604,"score_gpt":0.2333783384809117,"score_spread":0.2154298752739156,"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."}}