{"id":"https://openalex.org/W2166669220","doi":"https://doi.org/10.1145/1529282.1529595","title":"LS(graph & tree)","display_name":"LS(graph & tree)","publication_year":2009,"publication_date":"2009-03-08","ids":{"openalex":"https://openalex.org/W2166669220","doi":"https://doi.org/10.1145/1529282.1529595","mag":"2166669220"},"language":"en","primary_location":{"id":"doi:10.1145/1529282.1529595","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1529282.1529595","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2009 ACM symposium on Applied Computing","raw_type":"proceedings-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/A5108539131","display_name":"Pham Quang Dung","orcid":null},"institutions":[{"id":"https://openalex.org/I95674353","display_name":"UCLouvain","ror":"https://ror.org/02495e989","country_code":"BE","type":"education","lineage":["https://openalex.org/I95674353"]}],"countries":["BE"],"is_corresponding":true,"raw_author_name":"Pham Quang Dung","raw_affiliation_strings":["University of Louvain, Louvain-la-Neuve, Belgium"],"affiliations":[{"raw_affiliation_string":"University of Louvain, Louvain-la-Neuve, Belgium","institution_ids":["https://openalex.org/I95674353"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028020435","display_name":"Yves Deville","orcid":"https://orcid.org/0000-0002-6711-9992"},"institutions":[{"id":"https://openalex.org/I95674353","display_name":"UCLouvain","ror":"https://ror.org/02495e989","country_code":"BE","type":"education","lineage":["https://openalex.org/I95674353"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Yves Deville","raw_affiliation_strings":["University of Louvain, Louvain-la-Neuve, Belgium"],"affiliations":[{"raw_affiliation_string":"University of Louvain, Louvain-la-Neuve, Belgium","institution_ids":["https://openalex.org/I95674353"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035808622","display_name":"Pascal Van Hentenryck","orcid":"https://orcid.org/0000-0001-7085-9994"},"institutions":[{"id":"https://openalex.org/I27804330","display_name":"Brown University","ror":"https://ror.org/05gq02987","country_code":"US","type":"education","lineage":["https://openalex.org/I27804330"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Pascal Van Hentenryck","raw_affiliation_strings":["Brown University, Providence, RI"],"affiliations":[{"raw_affiliation_string":"Brown University, Providence, RI","institution_ids":["https://openalex.org/I27804330"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5108539131"],"corresponding_institution_ids":["https://openalex.org/I95674353"],"apc_list":null,"apc_paid":null,"fwci":2.7428,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.91435651,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1402","last_page":"1407"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9998000264167786,"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"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9944000244140625,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9901999831199646,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6675310730934143},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5089907646179199},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5079517960548401},{"id":"https://openalex.org/keywords/gomory\u2013hu-tree","display_name":"Gomory\u2013Hu tree","score":0.5023479461669922},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.4658653736114502},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.459276020526886},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.4275442361831665},{"id":"https://openalex.org/keywords/tree-depth","display_name":"Tree-depth","score":0.42092499136924744},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.35325539112091064},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.340758740901947},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.2559855580329895},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22825205326080322},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.22721505165100098},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.2204350233078003},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.14069557189941406},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10085216164588928},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.09456634521484375},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.07722386717796326}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6675310730934143},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5089907646179199},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5079517960548401},{"id":"https://openalex.org/C147517495","wikidata":"https://www.wikidata.org/wiki/Q5581241","display_name":"Gomory\u2013Hu tree","level":5,"score":0.5023479461669922},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.4658653736114502},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.459276020526886},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.4275442361831665},{"id":"https://openalex.org/C69284658","wikidata":"https://www.wikidata.org/wiki/Q7837500","display_name":"Tree-depth","level":5,"score":0.42092499136924744},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.35325539112091064},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.340758740901947},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.2559855580329895},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22825205326080322},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.22721505165100098},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.2204350233078003},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.14069557189941406},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10085216164588928},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.09456634521484375},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.07722386717796326},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1529282.1529595","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1529282.1529595","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2009 ACM symposium on Applied Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/12","display_name":"Responsible consumption and production","score":0.5799999833106995}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1506053358","https://openalex.org/W1512275225","https://openalex.org/W1591532012","https://openalex.org/W1652823179","https://openalex.org/W1948148225","https://openalex.org/W1963838724","https://openalex.org/W2006909611","https://openalex.org/W2010597367","https://openalex.org/W2017930865","https://openalex.org/W2024315858","https://openalex.org/W2034840381","https://openalex.org/W2075677840","https://openalex.org/W2088172021","https://openalex.org/W2092901467","https://openalex.org/W2093399914","https://openalex.org/W2094076493","https://openalex.org/W2115586117","https://openalex.org/W2140606557","https://openalex.org/W2736628755","https://openalex.org/W3195461621","https://openalex.org/W4293662999"],"related_works":["https://openalex.org/W2161128834","https://openalex.org/W2091348864","https://openalex.org/W2569549435","https://openalex.org/W2097415053","https://openalex.org/W2012141606","https://openalex.org/W1550482496","https://openalex.org/W2784687883","https://openalex.org/W2102858635","https://openalex.org/W2012694101","https://openalex.org/W2058170847"],"abstract_inverted_index":{"LS(Graph":[0,63],"&":[1,64],"Tree)":[2,65],"is":[3],"a":[4,50],"local":[5,68],"search":[6,69],"framework":[7,66],"which":[8,38],"aims":[9],"at":[10],"simplifying":[11],"the":[12,62,82,97,100],"modeling":[13,90],"of":[14,33,49,99],"Constraint":[15],"Satisfaction":[16],"Optimization":[17],"Problems":[18],"on":[19,22,35],"graphs":[20,23],"(CSOP":[21],"or":[24],"GCSOP).":[25],"Optimum":[26],"Constrained":[27],"Trees":[28],"(OCT)":[29],"problems":[30],"(a":[31],"subclass":[32],"CSOP":[34],"graphs)":[36],"in":[37,55],"we":[39],"need":[40],"to":[41,78],"find":[42],"an":[43],"optimum":[44],"subtree":[45],"with":[46],"additional":[47],"constraints":[48],"given":[51],"weighted":[52,84],"graph":[53],"arise":[54],"many":[56],"real-life":[57],"applications.":[58],"This":[59],"paper":[60],"introduces":[61],"and":[67,80],"abstractions":[70,75],"for":[71],"OCT":[72],"problems.":[73],"These":[74],"are":[76],"applied":[77],"model":[79],"solve":[81],"edge":[83],"k-Cardinality":[85],"Tree":[86],"(KCT)":[87],"problem.":[88],"The":[89],"as":[91,93],"well":[92],"experimental":[94],"results":[95],"show":[96],"significance":[98],"abstractions.":[101]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}