{"id":"W2170714987","doi":"10.1109/icvd.2004.1261038","title":"Shrubbery: a new algorithm for quickly growing high-quality Steiner trees","year":2004,"lang":"en","type":"article","venue":"","topic":"Low-power high-performance VLSI design","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Guelph","funders":"","keywords":"Steiner tree problem; Computer science; Tree (set theory); Routing (electronic design automation); Heuristic; Set (abstract data type); Interconnection; Algorithm; Shortest path problem; Path (computing); Approximation algorithm; Mathematics; Mathematical optimization; Combinatorics; Theoretical computer science; Graph; Artificial intelligence; Telecommunications","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.001291296,0.001291118,0.001248325,0.002107284,0.001021353,0.0008391513,0.002305732,0.001537861,0.006011064],"category_scores_gemma":[0.003916192,0.001121645,0.001052732,0.002203956,0.000809881,0.002686338,0.002271328,0.001078346,0.001293087],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008932082,"about_ca_system_score_gemma":0.001853305,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004382582,"about_ca_topic_score_gemma":0.009065492,"domain_scores_codex":[0.9993344,0.0001874247,0.00004740307,0.0001354595,0.0001987846,0.0000964361],"domain_scores_gemma":[0.9986365,0.0007037353,0.0001373092,0.0002243241,0.0002023878,0.00009573469],"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.000437542,0.0001725194,0.001345839,0.0004097708,0.0001299692,0.0002553613,0.0004408536,0.3293196,0.01229087,0.01599694,0.02019932,0.6190014],"study_design_scores_gemma":[0.0002890021,0.0002133115,0.0002940534,0.0000465564,0.00004148461,0.000229386,0.000132732,0.963499,0.00541278,0.01578719,0.01402409,0.00003042306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02246309,0.0005655583,0.9688925,0.0002565518,0.0000602127,0.0002904902,0.0002427687,0.004098307,0.003130486],"genre_scores_gemma":[0.04761304,0.0001838552,0.949521,0.0001158842,0.0000201135,0.0002348778,0.0005415508,0.0004701673,0.001299494],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006011064,"threshold_uncertainty_score":0.02010906,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01484288593307164,"score_gpt":0.2387054708610056,"score_spread":0.2238625849279339,"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."}}