{"id":"https://openalex.org/W2050339304","doi":"https://doi.org/10.1007/s10107-003-0410-x","title":"The clustering matroid and the optimal clustering tree","display_name":"The clustering matroid and the optimal clustering tree","publication_year":2003,"publication_date":"2003-09-01","ids":{"openalex":"https://openalex.org/W2050339304","doi":"https://doi.org/10.1007/s10107-003-0410-x","mag":"2050339304"},"language":"en","primary_location":{"id":"doi:10.1007/s10107-003-0410-x","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-003-0410-x","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5074054097","display_name":"Ephraim Korach","orcid":null},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Ephraim Korach","raw_affiliation_strings":["Department of Industrial Engineering and Management, Ben-Gurion University of the Negev, Beer-Sheva, Israel, 84105","Department of industrial Engineering and Management, Ben-Gurion University of the Negev, Beer-Sheva, Israel"],"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering and Management, Ben-Gurion University of the Negev, Beer-Sheva, Israel, 84105","institution_ids":["https://openalex.org/I124227911"]},{"raw_affiliation_string":"Department of industrial Engineering and Management, Ben-Gurion University of the Negev, Beer-Sheva, Israel","institution_ids":["https://openalex.org/I124227911"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5037210315","display_name":"Michal Stern","orcid":"https://orcid.org/0000-0002-4073-635X"},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Michal Stern","raw_affiliation_strings":["Department of Industrial Engineering and Management, Ben-Gurion University of the Negev, Beer-Sheva, Israel, 84105","Department of industrial Engineering and Management, Ben-Gurion University of the Negev, Beer-Sheva, Israel"],"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering and Management, Ben-Gurion University of the Negev, Beer-Sheva, Israel, 84105","institution_ids":["https://openalex.org/I124227911"]},{"raw_affiliation_string":"Department of industrial Engineering and Management, Ben-Gurion University of the Negev, Beer-Sheva, Israel","institution_ids":["https://openalex.org/I124227911"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5074054097"],"corresponding_institution_ids":["https://openalex.org/I124227911"],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.7331,"has_fulltext":false,"cited_by_count":47,"citation_normalized_percentile":{"value":0.71336996,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"98","issue":"1-3","first_page":"385","last_page":"414"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9933000206947327,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9933000206947327,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.992900013923645,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11342","display_name":"Carbon and Quantum Dots Applications","score":0.9736999869346619,"subfield":{"id":"https://openalex.org/subfields/2505","display_name":"Materials Chemistry"},"field":{"id":"https://openalex.org/fields/25","display_name":"Materials Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/matroid","display_name":"Matroid","score":0.9091518521308899},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.728641152381897},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6932908892631531},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.5903971195220947},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5864502191543579},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.5792065858840942},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.5368789434432983},{"id":"https://openalex.org/keywords/graphic-matroid","display_name":"Graphic matroid","score":0.5243402123451233},{"id":"https://openalex.org/keywords/matroid-partitioning","display_name":"Matroid partitioning","score":0.4769377112388611},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.4761655032634735},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.45654037594795227},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.4536546766757965},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4524849057197571},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4342733919620514},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2800547778606415},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.267656147480011},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.20400241017341614}],"concepts":[{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.9091518521308899},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.728641152381897},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6932908892631531},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.5903971195220947},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5864502191543579},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5792065858840942},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.5368789434432983},{"id":"https://openalex.org/C111034964","wikidata":"https://www.wikidata.org/wiki/Q5597156","display_name":"Graphic matroid","level":3,"score":0.5243402123451233},{"id":"https://openalex.org/C22425182","wikidata":"https://www.wikidata.org/wiki/Q6787906","display_name":"Matroid partitioning","level":4,"score":0.4769377112388611},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.4761655032634735},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45654037594795227},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.4536546766757965},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4524849057197571},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4342733919620514},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2800547778606415},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.267656147480011},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.20400241017341614},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s10107-003-0410-x","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-003-0410-x","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W112858196","https://openalex.org/W176396925","https://openalex.org/W1991528957","https://openalex.org/W2011039300","https://openalex.org/W2012200612","https://openalex.org/W2030645588","https://openalex.org/W2036751548","https://openalex.org/W2111741734","https://openalex.org/W2143474538","https://openalex.org/W2340149117","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2058489697","https://openalex.org/W1978034843","https://openalex.org/W620960161","https://openalex.org/W2045244794","https://openalex.org/W193918669","https://openalex.org/W1576317141","https://openalex.org/W1587959445","https://openalex.org/W1958279402","https://openalex.org/W2350349857","https://openalex.org/W2621339359"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}