{"id":"https://openalex.org/W2006909611","doi":"https://doi.org/10.1145/1498698.1537600","title":"Obtaining optimal <i>k</i> -cardinality trees fast","display_name":"Obtaining optimal <i>k</i> -cardinality trees fast","publication_year":2009,"publication_date":"2009-12-01","ids":{"openalex":"https://openalex.org/W2006909611","doi":"https://doi.org/10.1145/1498698.1537600","mag":"2006909611"},"language":"en","primary_location":{"id":"doi:10.1145/1498698.1537600","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1498698.1537600","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","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/A5044475263","display_name":"Markus Chimani","orcid":"https://orcid.org/0000-0002-4681-5550"},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Markus Chimani","raw_affiliation_strings":["TU Dortmund, Dortmund, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"TU Dortmund, Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5071274716","display_name":"Maria Kandyba","orcid":null},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Maria Kandyba","raw_affiliation_strings":["TU Dortmund, Dortmund, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"TU Dortmund, Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5009286436","display_name":"Ivana Ljubi\u0107","orcid":"https://orcid.org/0000-0002-4834-6284"},"institutions":[{"id":"https://openalex.org/I129774422","display_name":"University of Vienna","ror":"https://ror.org/03prydq77","country_code":"AT","type":"education","lineage":["https://openalex.org/I129774422"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Ivana Ljubi\u0107","raw_affiliation_strings":["University of Vienna, Vienna, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Vienna, Vienna, Austria","institution_ids":["https://openalex.org/I129774422"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012801992","display_name":"Petra Mutzel","orcid":"https://orcid.org/0000-0001-7621-971X"},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Petra Mutzel","raw_affiliation_strings":["TU Dortmund, Dortmund, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"TU Dortmund, Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5044475263"],"corresponding_institution_ids":["https://openalex.org/I200332995"],"apc_list":null,"apc_paid":null,"fwci":9.8388,"has_fulltext":false,"cited_by_count":24,"citation_normalized_percentile":{"value":0.97760256,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"14","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9973999857902527,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.7416356205940247},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.7135348916053772},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.529228687286377},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5029670596122742},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.49371227622032166},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4571819305419922},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.434495747089386},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.427692711353302},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4252513647079468},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42006027698516846},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4177585244178772},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.33559513092041016},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11121988296508789}],"concepts":[{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.7416356205940247},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.7135348916053772},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.529228687286377},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5029670596122742},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.49371227622032166},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4571819305419922},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.434495747089386},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.427692711353302},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4252513647079468},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42006027698516846},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4177585244178772},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33559513092041016},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11121988296508789},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1498698.1537600","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1498698.1537600","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3171094092","display_name":null,"funder_award_id":"SFB 531","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W124060458","https://openalex.org/W1211282206","https://openalex.org/W1486380325","https://openalex.org/W1521430582","https://openalex.org/W1524370859","https://openalex.org/W1556386174","https://openalex.org/W1575625195","https://openalex.org/W1576264677","https://openalex.org/W1976222519","https://openalex.org/W1984815404","https://openalex.org/W1992404598","https://openalex.org/W2001139415","https://openalex.org/W2010597367","https://openalex.org/W2017765977","https://openalex.org/W2034256646","https://openalex.org/W2038190710","https://openalex.org/W2064963298","https://openalex.org/W2073202630","https://openalex.org/W2074613642","https://openalex.org/W2083042895","https://openalex.org/W2088761355","https://openalex.org/W2112638680","https://openalex.org/W2119918317","https://openalex.org/W2127814549","https://openalex.org/W2140951480","https://openalex.org/W2147258429","https://openalex.org/W2152216760","https://openalex.org/W2155239253","https://openalex.org/W2336259629","https://openalex.org/W2569576952","https://openalex.org/W2578818905","https://openalex.org/W3004042307","https://openalex.org/W4255005259","https://openalex.org/W4255280903","https://openalex.org/W6823566691"],"related_works":["https://openalex.org/W2002177687","https://openalex.org/W2789681586","https://openalex.org/W2794361564","https://openalex.org/W4243392960","https://openalex.org/W3156820950","https://openalex.org/W4232791346","https://openalex.org/W2011675579","https://openalex.org/W2066405186","https://openalex.org/W4294093684","https://openalex.org/W1659690962"],"abstract_inverted_index":{"Given":[0],"an":[1,65,99],"undirected":[2],"graph":[3],"G":[4,33],"=":[5],"(":[6],"V":[7],",":[8,20],"E":[9],")":[10],"with":[11,34],"edge":[12],"weights":[13],"and":[14,38,57,89,131,136],"a":[15,29,120],"positive":[16],"integer":[17],"number":[18],"k":[19,22,36],"the":[21,39,75,81,91,103,109,115,148,152,155,162],"-cardinality":[23],"tree":[24],"problem":[25,121],"consists":[26],"of":[27,32,77,86,93,150,154,167],"finding":[28],"subtree":[30],"T":[31],"exactly":[35],"edges":[37],"minimum":[40],"possible":[41],"weight.":[42],"Many":[43],"algorithms":[44,128],"have":[45],"been":[46],"proposed":[47],"to":[48,80,108,114],"solve":[49],"this":[50,61,87],"NP-hard":[51],"problem,":[52,88],"resulting":[53],"in":[54,165],"mainly":[55],"heuristic":[56],"metaheuristic":[58,163],"approaches.":[59],"In":[60,112],"article,":[62],"we":[63,97],"present":[64],"exact":[66,127],"ILP-based":[67],"algorithm":[68,144],"using":[69],"directed":[70],"cuts.":[71],"We":[72],"mathematically":[73],"compare":[74],"strength":[76],"our":[78,94,139,143],"formulation":[79],"previously":[82],"known":[83],"ILP":[84],"formulations":[85],"show":[90,141],"advantages":[92],"approach.":[95],"Afterwards,":[96],"give":[98],"extensive":[100],"study":[101],"on":[102],"algorithm's":[104],"practical":[105],"performance":[106],"compared":[107],"state-of-the-art":[110],"metaheuristics.":[111],"contrast":[113],"widespread":[116],"assumption":[117],"that":[118,142],"such":[119],"cannot":[122],"be":[123],"efficiently":[124],"tackled":[125],"by":[126],"for":[129],"medium":[130],"large":[132],"graphs":[133],"(between":[134],"200":[135],"5,000":[137],"nodes),":[138],"results":[140],"not":[145],"only":[146],"has":[147],"advantage":[149],"proving":[151],"optimality":[153],"computed":[156],"solution,":[157],"but":[158],"also":[159],"often":[160],"outperforms":[161],"approaches":[164],"terms":[166],"running":[168],"time.":[169]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":4}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}