{"doi":"10.1109/tcad.2012.2185050","title":"Obstacle-Avoiding Rectilinear Steiner Tree Construction: A Steiner-Point-Based Algorithm","abstract":null,"journal":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems","year":2012,"id":45458,"datarank":2.1508956353608677,"base_score":3.5553480614894135,"endowment":3.5553480614894135,"self_citation_contribution":0.5333022092234121,"citation_network_contribution":1.6175934261374556,"self_endowment_contribution":0.5333022092234121,"citer_contribution":1.6175934261374556,"corpus_percentile":null,"corpus_rank":null,"citation_count":34,"citer_count":33,"citers_with_citation_signal":25,"citers_with_endowment":25,"datacite_reuse_total":0,"is_dataset":false,"is_dataset_confidence":null,"is_data_producer":false,"deposit_databanks":null,"is_oa":false,"file_count":0,"downloads":0,"has_version_chain":false,"published_date":null,"fair_score":null,"fair_percentile":null,"algorithm_id":"datarank_citation_only_1hop_v6","ranking_scope":"data_only","authors":[{"id":212339,"name":"Sy-Yen Kuo","orcid":null,"position":1,"is_corresponding":false},{"id":212340,"name":"D. T. Lee","orcid":null,"position":2,"is_corresponding":false},{"id":212341,"name":"Chun-Syun Lin","orcid":null,"position":3,"is_corresponding":false},{"id":212342,"name":"Jung-Hung Weng","orcid":null,"position":4,"is_corresponding":false},{"id":212343,"name":"Shih-Yi Yuan","orcid":null,"position":5,"is_corresponding":false},{"id":212338,"name":"Chih-Hung Liu","orcid":null,"position":0,"is_corresponding":false}],"reference_count":0,"raw_metadata":{"has_enrichment":true,"base_score":3.5553480614894135,"endowment":3.5553480614894135,"datacite_reuse_total":0,"file_count":0,"downloads":0,"views":0,"has_version_chain":false,"is_dataset":false,"is_oa":false,"pmid":"21071399","pmcid":null,"openalex_id":"https://openalex.org/W2025658531","authors":[],"funders":[],"total_grants":0,"fwci":1.499,"citation_percentile":0.83809459,"influential_citations":6,"citation_trend":[{"year":2013,"count":1},{"year":2014,"count":3},{"year":2015,"count":2},{"year":2016,"count":2},{"year":2017,"count":2},{"year":2018,"count":3},{"year":2019,"count":5},{"year":2020,"count":3},{"year":2021,"count":3},{"year":2022,"count":2},{"year":2023,"count":2},{"year":2024,"count":2},{"year":2025,"count":3},{"year":2026,"count":1}],"oa_status":"closed","license":"https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html","oa_locations":[{"url":"http://xplorestaging.ieee.org/ielx5/43/6218208/06218228.pdf?arnumber=6218228","host_type":"publisher"},{"url":"https://doi.org/10.1109/tcad.2012.2185050","host_type":"journal"}],"fields_of_study":["VLSI and FPGA Design Techniques","Vehicle Routing Optimization Methods","Infrastructure Maintenance and Monitoring","Computer Science","Mathematics"],"mesh_terms":[],"keywords":["Steiner tree problem","Heuristics","Obstacle","Bottleneck","Steiner system","Point (geometry)","Computer science","Algorithm","Graph","Mathematics","Mathematical optimization","Combinatorics","Theoretical computer science"],"sdg_mappings":[{"sdg_number":0,"sdg_label":"Life in Land"}],"linked_datasets":[],"clinical_trials":[],"software_tools":[],"database_accessions":[],"source":"live","citation_network_status":"fetched"},"created_at":"2026-07-03T20:15:54.189505Z","pmid":null,"pmcid":null,"fwci":null,"citation_percentile":null,"influential_citations":0,"oa_status":null,"license":null,"views":0,"total_file_size_bytes":0,"version_count":0,"fair_f":null,"fair_a":null,"fair_i":null,"fair_r":null,"fair_zscore":null,"fair_rationale":null,"fair_model":null,"fair_agent_version":null,"fair_fulltext_source":null,"fair_has_llm":null,"fair_computed_at":null,"clinical_trials":[],"software_tools":[],"db_accessions":[],"linked_datasets":[],"topics":[]}