{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002490738,0.0003837713,0.0003831867,0.0009594578,0.000272006,0.0004168327,0.003289483,0.0002667614,0.000006328152],"category_scores_gemma":[0.0001627536,0.0003670947,0.00004894951,0.0007636718,0.0007909252,0.0006208472,0.001680156,0.001432857,0.00001140334],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003152376,"about_ca_system_score_gemma":0.000182188,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008718467,"about_ca_topic_score_gemma":0.00005558953,"domain_scores_codex":[0.9968429,0.0001775102,0.0004212855,0.001201012,0.0006792104,0.0006780762],"domain_scores_gemma":[0.9956154,0.002340035,0.0001894112,0.001605898,0.000114497,0.0001347375],"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.000008032763,0.00001215653,0.00001910387,0.000003970289,0.00000185897,0.00001776158,0.0002878671,0.383532,0.000009103909,0.1416648,0.000002467867,0.4744408],"study_design_scores_gemma":[0.0001722358,0.00009006412,0.00007482111,0.0003039965,8.863474e-7,0.00001774051,8.574155e-8,0.6746745,0.00007486196,0.3242719,0.0000574334,0.0002614741],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00007012176,0.0006512289,0.9966941,0.0005698126,0.0002032336,0.0004831094,4.375048e-7,0.00008782372,0.001240105],"genre_scores_gemma":[0.3830531,0.0002580482,0.6154043,0.001003011,0.0001200921,0.0000141156,0.000001838338,0.00003146957,0.0001139758],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4741793,"threshold_uncertainty_score":0.9998781,"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."}}