{"doi":"10.7763/ijcte.2013.v5.739","title":"A Novel Ant Colony Optimization-Based Algorithm for the Optimal Communication Spanning Tree Problem","abstract":null,"journal":"International Journal of Computer Theory and Engineering","year":2013,"id":39129,"datarank":0.5130269578289566,"base_score":1.791759469228055,"endowment":1.791759469228055,"self_citation_contribution":0.26876392038420827,"citation_network_contribution":0.24426303744474837,"self_endowment_contribution":0.26876392038420827,"citer_contribution":0.24426303744474837,"corpus_percentile":null,"corpus_rank":null,"citation_count":5,"citer_count":3,"citers_with_citation_signal":3,"citers_with_endowment":3,"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":192838,"name":"Dac-Nhuong Le","orcid":null,"position":1,"is_corresponding":false},{"id":192839,"name":"Nguyen Dang Le","orcid":null,"position":2,"is_corresponding":false},{"id":192837,"name":"Nhu Gia Nguyen","orcid":null,"position":0,"is_corresponding":false}],"reference_count":0,"raw_metadata":{"has_enrichment":true,"base_score":1.791759469228055,"endowment":1.791759469228055,"datacite_reuse_total":0,"file_count":0,"downloads":0,"views":0,"has_version_chain":false,"is_dataset":false,"is_oa":false,"pmid":"18998881","pmcid":null,"openalex_id":"https://openalex.org/W2113041486","authors":[],"funders":[],"total_grants":0,"fwci":0.9883,"citation_percentile":0.83305851,"influential_citations":0,"citation_trend":[{"year":2013,"count":2},{"year":2021,"count":1},{"year":2022,"count":1},{"year":2023,"count":1}],"oa_status":"closed","license":null,"oa_locations":[{"url":"http://www.ijcte.org/papers/739-T018.pdf","host_type":"BRONZE"},{"url":"https://doi.org/10.7763/ijcte.2013.v5.739","host_type":"journal"}],"fields_of_study":["Metaheuristic Optimization Algorithms Research","Vehicle Routing Optimization Methods","Optimization and Packing Problems","Computer Science"],"mesh_terms":[],"keywords":["Computer science","Ant colony optimization algorithms","Spanning tree","Tree (set theory)","Minimum spanning tree","Mathematical optimization","Optimization algorithm","ANT","Artificial intelligence","Algorithm","Mathematics","Computer network"],"sdg_mappings":[],"linked_datasets":[],"clinical_trials":[],"software_tools":[],"database_accessions":[],"source":"live","citation_network_status":"fetched"},"created_at":"2026-06-11T16:40:57.485785Z","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":[]}