{"id":"W1523383428","doi":"10.1007/11602613_104","title":"On Routing in VLSI Design and Communication Networks","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo; McMaster University","funders":"","keywords":"Steiner tree problem; Routing (electronic design automation); Computer science; Vertex (graph theory); Mathematical optimization; Approximation algorithm; Multicast; Very-large-scale integration; Integer programming; Linear programming; Theoretical computer science; Mathematics; Distributed computing; Computer network; 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.0004491045,0.0013675,0.0008965278,0.001010248,0.0004688654,0.001344902,0.001386803,0.001072302,0.0138973],"category_scores_gemma":[0.001190425,0.0006678492,0.0004574158,0.002217941,0.00106635,0.002712267,0.0009564215,0.001558985,0.004725547],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007664264,"about_ca_system_score_gemma":0.0004855549,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005239462,"about_ca_topic_score_gemma":0.001212289,"domain_scores_codex":[0.9996778,0.00008628763,0.00001687975,0.00004640985,0.0001425334,0.00003010389],"domain_scores_gemma":[0.9996198,0.000208874,0.00001801306,0.00007726702,0.00006072095,0.00001519065],"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.00003737779,0.00005037311,0.000123921,0.0007262137,0.00003455034,0.00008628847,0.0001463299,0.01994213,0.003081692,0.4828193,0.08577114,0.4071808],"study_design_scores_gemma":[0.00001954644,0.00007058385,0.0002487126,0.0003326638,0.00004575722,0.0003081244,0.00006904385,0.03643513,0.002125981,0.5577661,0.4025551,0.00002315208],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005376434,0.08991234,0.6466343,0.005294494,0.006279617,0.0001420396,0.0002563343,0.001155419,0.2449491],"genre_scores_gemma":[0.09805562,0.1690658,0.3779885,0.003434183,0.005846491,0.0004378393,0.000840748,0.001067567,0.3432632],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0138973,"threshold_uncertainty_score":0.04649109,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02756434756253712,"score_gpt":0.2847050503729536,"score_spread":0.2571407028104165,"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."}}