{"id":"W1570456368","doi":"10.1109/ccece.2001.933590","title":"An efficient rectilinear Steiner tree algorithm for VLSI global routing","year":2002,"lang":"en","type":"article","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo; University of Guelph","funders":"","keywords":"Steiner tree problem; Routing (electronic design automation); Very-large-scale integration; Heuristics; Computer science; Algorithm; Tree (set theory); Spanning tree; Integrated circuit layout; Mathematics; Topology (electrical circuits); Mathematical optimization; Discrete mathematics; Combinatorics; Integrated circuit; Computer network","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.0002743524,0.0006561511,0.0006063762,0.0007275469,0.0004123058,0.0004681312,0.000683278,0.000533617,0.004639753],"category_scores_gemma":[0.0006397908,0.0004065493,0.00057213,0.001222852,0.0002699837,0.001292446,0.0006394144,0.0005103593,0.001443135],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004730988,"about_ca_system_score_gemma":0.0008328278,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00217211,"about_ca_topic_score_gemma":0.004549969,"domain_scores_codex":[0.9997826,0.00005675613,0.00001707711,0.0000494231,0.00006726287,0.00002691024],"domain_scores_gemma":[0.9998492,0.00005159977,0.00001714608,0.00003573063,0.0000377625,0.000008448218],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002366206,0.0000665963,0.000465112,0.0002673276,0.00005983612,0.0001591512,0.0001485717,0.3382332,0.02185916,0.03400555,0.01607231,0.5884266],"study_design_scores_gemma":[0.00009831089,0.0001568191,0.0003238799,0.00002006982,0.0000243401,0.0002096529,0.00004322638,0.9509267,0.00538922,0.02491436,0.01787007,0.000023437],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0123478,0.00054563,0.9818827,0.0001617844,0.00002959352,0.00007316576,0.0002286573,0.001200511,0.003530123],"genre_scores_gemma":[0.06360963,0.0003282728,0.9321579,0.00004338203,0.00001400645,0.00009393728,0.0006931381,0.0001444473,0.00291523],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004639753,"threshold_uncertainty_score":0.01552147,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01568185559463069,"score_gpt":0.2371789824378945,"score_spread":0.2214971268432638,"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."}}