{"id":"https://openalex.org/W2068829194","doi":"https://doi.org/10.1145/75427.1030298","title":"Optimal & near-optimal space efficient decision diagram algorithms","display_name":"Optimal & near-optimal space efficient decision diagram algorithms","publication_year":1989,"publication_date":"1989-02-21","ids":{"openalex":"https://openalex.org/W2068829194","doi":"https://doi.org/10.1145/75427.1030298","mag":"2068829194"},"language":"en","primary_location":{"id":"mag:2068829194","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/acm/csc89.html#Khuri89","pdf_url":null,"source":{"id":"https://openalex.org/S4306523556","display_name":"Proceedings of the 17th conference on ACM Annual Computer Science Conference","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Proceedings of the 17th conference on ACM Annual Computer Science Conference","raw_type":null},"type":"article","indexed_in":[],"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/A5109849624","display_name":"Sami Khuri","orcid":null},"institutions":[{"id":"https://openalex.org/I189731429","display_name":"Wellesley College","ror":"https://ror.org/01srpnj69","country_code":"US","type":"education","lineage":["https://openalex.org/I189731429"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Sami Khuri","raw_affiliation_strings":["Wellesley College, Wellesley, Ma 02181"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Wellesley College, Wellesley, Ma 02181","institution_ids":["https://openalex.org/I189731429"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5109849624"],"corresponding_institution_ids":["https://openalex.org/I189731429"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.41322314,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"467","last_page":"467"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11063","display_name":"Rough Sets and Fuzzy Logic","score":0.9330000281333923,"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/T11063","display_name":"Rough Sets and Fuzzy Logic","score":0.9330000281333923,"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.9110999703407288,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9038000106811523,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/influence-diagram","display_name":"Influence diagram","score":0.6228772401809692},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5565854907035828},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5179721117019653},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4859699010848999},{"id":"https://openalex.org/keywords/optimal-decision","display_name":"Optimal decision","score":0.45566433668136597},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.4446568489074707},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3553859293460846},{"id":"https://openalex.org/keywords/decision-tree","display_name":"Decision tree","score":0.3242354094982147},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.10900858044624329}],"concepts":[{"id":"https://openalex.org/C20837028","wikidata":"https://www.wikidata.org/wiki/Q623966","display_name":"Influence diagram","level":3,"score":0.6228772401809692},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5565854907035828},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5179721117019653},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4859699010848999},{"id":"https://openalex.org/C150325174","wikidata":"https://www.wikidata.org/wiki/Q4335500","display_name":"Optimal decision","level":3,"score":0.45566433668136597},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.4446568489074707},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3553859293460846},{"id":"https://openalex.org/C84525736","wikidata":"https://www.wikidata.org/wiki/Q831366","display_name":"Decision tree","level":2,"score":0.3242354094982147},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.10900858044624329}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2068829194","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/acm/csc89.html#Khuri89","pdf_url":null,"source":{"id":"https://openalex.org/S4306523556","display_name":"Proceedings of the 17th conference on ACM Annual Computer Science Conference","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Proceedings of the 17th conference on ACM Annual Computer Science Conference","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5899999737739563,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1529613046","https://openalex.org/W2265461452","https://openalex.org/W3164824051","https://openalex.org/W2529394001","https://openalex.org/W2793678047","https://openalex.org/W3132265628","https://openalex.org/W2123260089","https://openalex.org/W3032903144","https://openalex.org/W2405621756","https://openalex.org/W1582185751","https://openalex.org/W3032367597","https://openalex.org/W1643794750","https://openalex.org/W3035114326","https://openalex.org/W76950382","https://openalex.org/W2133615887","https://openalex.org/W1973312922","https://openalex.org/W2902917605","https://openalex.org/W1509061480","https://openalex.org/W2604998762","https://openalex.org/W2969470403"],"abstract_inverted_index":{"The":[0,79,153,188],"purpose":[1],"of":[2,9,69,122,149,167,180,190,199,208,246,253],"this":[3,227,254],"work":[4],"is":[5,24,44,156,184,193,211,229],"to":[6,128,160,226],"investigate":[7],"some":[8],"the":[10,29,70,98,112,120,129,147,165,178,206,218,235,244,250],"algorithms":[11,118],"used":[12],"for":[13,86,119,214],"representing":[14,76,97],"switching":[15],"functions":[16],"by":[17],"space":[18],"efficient":[19],"decision":[20,61,94,124,182,191],"diagrams.":[21],"This":[22,169],"representation":[23],"an":[25,185],"optimization":[26,33],"problem.":[27,187],"Adopting":[28],"terminology":[30],"from":[31],"combinatorial":[32],"problems,":[34],"we":[35],"have:Problem":[36],"Instance:":[37],"A":[38,60,93],"multivalued":[39],"function":[40,99],"f(x)":[41],"where":[42],"x":[43],"a":[45,48,107,223],"vector,":[46],"and":[47,143,158],"storing":[49],"cost,":[50],"s(xi),":[51],"associated":[52],"with":[53,67,100,126,243],"each":[54,87],"variable":[55],"xi":[56],"in":[57,164,175],"x.Feasible":[58],"Solution:":[59,92],"diagram":[62,95],"D":[63,96],"(acyclic,":[64],"directed":[65],"graph":[66],"indegrees":[68],"internal":[71],"nodes":[72],"possibly":[73],"exeeding":[74],"one)":[75],"f(x).Objective":[77],"Function:":[78],"total":[80,102,130,219],"storage":[81,103,131,220],"cost,S(D)":[82],"=":[83],"\u03a3":[84],"s(xi)":[85],"feasible":[88,108],"solution":[89,109],"D.xie":[90],"DOptimal":[91],"minimum":[101],"cost":[104,132],"S(D),":[105],"i.e.":[106],"which":[110],"minimizes":[111],"objective":[113],"function.To":[114],"date,":[115],"only":[116],"two":[117],"construction":[121,179,189],"optimal":[123,181,209],"diagrams":[125,192,210],"respect":[127],"have":[133],"been":[134],"developed;":[135],"Reinwald":[136],"&":[137,140],"Soland's":[138],"branch":[139],"bound":[141],"algorithm":[142,155,248],"Thayse's,":[144],"based":[145,233],"on":[146,234],"extension":[148],"Shannon's":[150],"expansion":[151],"formula.":[152],"second":[154],"analyzed":[157],"proven":[159],"be":[161],"highly":[162],"exponential":[163],"number":[166],"variables.":[168],"comes":[170],"as":[171],"no":[172],"surprise":[173],"since,":[174],"most":[176,215],"cases,":[177],"trees":[183],"NP-hard":[186,213],"generally":[194],"more":[195],"complicated":[196],"than":[197],"that":[198,205],"trees.":[200],"One":[201],"cannot":[202],"seriously":[203],"doubt":[204],"constructions":[207],"also":[212],"costs":[216],"including":[217],"cost.":[221],"Therefore,":[222],"heuristic":[224],"approach":[225],"problem":[228],"needed.":[230],"Two":[231],"heuristics,":[232],"greedy":[236],"algorithmic":[237],"technique,":[238],"are":[239],"presented.":[240],"These":[241],"heuristics":[242],"analysis":[245],"Thayse's":[247],"constitute":[249],"major":[251],"achievements":[252],"work.":[255]},"counts_by_year":[],"updated_date":"2026-04-28T14:05:53.105641","created_date":"2025-10-10T00:00:00"}