{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005436782,0.000314606,0.0003400143,0.0006641764,0.00006439167,0.0001390056,0.0003237501,0.0002187767,0.00000109411],"category_scores_gemma":[0.00002677373,0.0002910986,0.00005007931,0.0001934919,0.0001197643,0.0002076218,0.00004699046,0.0003113514,5.786526e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001267825,"about_ca_system_score_gemma":0.00002953578,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009248876,"about_ca_topic_score_gemma":0.0001027525,"domain_scores_codex":[0.9984276,0.000009057695,0.0004079219,0.0005393024,0.0002709544,0.0003452158],"domain_scores_gemma":[0.9994057,0.0001141756,0.00008237547,0.0002907199,0.00005182358,0.0000552049],"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.00001306536,0.000009767977,0.00001662565,0.0000785079,0.000007236939,0.00001391122,0.0005660691,0.01758033,0.0009146656,0.001448945,0.00007179972,0.9792791],"study_design_scores_gemma":[0.0006960762,0.0002335778,0.0002792342,0.0008215357,0.0000107331,0.00001666837,7.701132e-7,0.8357116,0.007860064,0.1525691,0.001141909,0.0006587118],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001640858,0.0004481492,0.9972752,0.00009238791,0.0002902114,0.0006042949,0.00002973684,0.0002029418,0.0008929682],"genre_scores_gemma":[0.3567044,0.0003361892,0.6418159,0.0003247225,0.0004165747,0.0000714114,0.0001049411,0.00008682277,0.0001389873],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9786204,"threshold_uncertainty_score":0.9999541,"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."}}