{"doi":"10.1007/978-3-662-43948-7_28","title":"Fast Algorithms for Constructing Maximum Entropy Summary Trees","abstract":null,"journal":"Lecture Notes in Computer Science","year":2014,"id":39063,"datarank":0.197523793493325,"base_score":1.0986122886681096,"endowment":1.0986122886681096,"self_citation_contribution":0.16479184330021646,"citation_network_contribution":0.032731950193108525,"self_endowment_contribution":0.16479184330021646,"citer_contribution":0.032731950193108525,"corpus_percentile":null,"corpus_rank":null,"citation_count":2,"citer_count":2,"citers_with_citation_signal":1,"citers_with_endowment":1,"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":192677,"name":"Howard Karloff","orcid":null,"position":1,"is_corresponding":false},{"id":192676,"name":"Richard Cole","orcid":null,"position":0,"is_corresponding":false}],"reference_count":0,"raw_metadata":{"has_enrichment":true,"base_score":1.0986122886681096,"endowment":1.0986122886681096,"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/W1571304412","authors":[],"funders":[{"funder_name":"National Science Foundation","grant_id":"1217989","title":"AF:Small:Markets, Allocations and Dynamics"}],"total_grants":1,"fwci":0.2322,"citation_percentile":0.59039772,"influential_citations":0,"citation_trend":[{"year":2017,"count":1},{"year":2018,"count":1}],"oa_status":"closed","license":"Springer TDM","oa_locations":[{"url":"http://www.cs.nyu.edu/cole/papers/icalp14.pdf","host_type":"GREEN"},{"url":"http://link.springer.com/content/pdf/10.1007/978-3-662-43948-7_28","host_type":"publisher"},{"url":"https://doi.org/10.1007/978-3-662-43948-7_28","host_type":"book series"},{"url":"http://arxiv.org/pdf/1404.5660","host_type":""},{"url":"https://dx.doi.org/10.48550/arxiv.1404.5660","host_type":""},{"url":"http://arxiv.org/abs/1404.5660","host_type":""},{"url":"https://dx.doi.org/10.1007/978-3-662-43948-7_28","host_type":""}],"fields_of_study":["Data Visualization and Analytics","Data Management and Algorithms","Topological and Geometric Data Analysis","Mathematics","Computer Science","0202 electrical engineering, electronic engineering, information engineering","02 engineering and technology"],"mesh_terms":[],"keywords":["Time complexity","Greedy algorithm","Entropy (arrow of time)","Computer science","Heuristic","Algorithm","Combinatorics","Tree (set theory)","Running time","Weight-balanced tree","Node (physics)","Upper and lower bounds","Mathematics","Discrete mathematics","Mathematical optimization","Binary search tree","Binary tree","FOS: Computer and information sciences","Computer Science - Data Structures and Algorithms","Data Structures and Algorithms (cs.DS)"],"sdg_mappings":[{"sdg_number":13,"sdg_label":"13. Climate action"}],"linked_datasets":[],"clinical_trials":[],"software_tools":[],"database_accessions":[],"source":"live","citation_network_status":"fetched"},"created_at":"2026-06-11T15:07:12.959504Z","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":[]}