{"id":"https://openalex.org/W2062459871","doi":"https://doi.org/10.1137/0220004","title":"Simple Local Search Problems that are Hard to Solve","display_name":"Simple Local Search Problems that are Hard to Solve","publication_year":1991,"publication_date":"1991-02-01","ids":{"openalex":"https://openalex.org/W2062459871","doi":"https://doi.org/10.1137/0220004","mag":"2062459871"},"language":"en","primary_location":{"id":"doi:10.1137/0220004","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0220004","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5000317216","display_name":"Alejandro A. Sch\u00e4ffer","orcid":"https://orcid.org/0000-0002-2147-8033"},"institutions":[{"id":"https://openalex.org/I74775410","display_name":"Rice University","ror":"https://ror.org/008zs3103","country_code":"US","type":"education","lineage":["https://openalex.org/I74775410"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Alejandro A. Sch\u00e4ffer","raw_affiliation_strings":["Rice University (Houston, TX)"],"affiliations":[{"raw_affiliation_string":"Rice University (Houston, TX)","institution_ids":["https://openalex.org/I74775410"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5000317216"],"corresponding_institution_ids":["https://openalex.org/I74775410"],"apc_list":null,"apc_paid":null,"fwci":6.6697,"has_fulltext":false,"cited_by_count":297,"citation_normalized_percentile":{"value":0.97772434,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":97,"max":100},"biblio":{"volume":"20","issue":"1","first_page":"56","last_page":"87"},"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.9994999766349792,"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.9994999766349792,"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.9994000196456909,"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.9991000294685364,"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/simple","display_name":"Simple (philosophy)","score":0.5543458461761475},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5387654304504395},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.5293282270431519},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.5228381752967834},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.42318984866142273},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.37606778740882874},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3642094135284424},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.33849793672561646},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33836594223976135}],"concepts":[{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5543458461761475},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5387654304504395},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.5293282270431519},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.5228381752967834},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.42318984866142273},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.37606778740882874},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3642094135284424},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.33849793672561646},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33836594223976135},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0220004","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0220004","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1597286183","https://openalex.org/W1980746862","https://openalex.org/W2026143151","https://openalex.org/W2031178115","https://openalex.org/W2042986967","https://openalex.org/W2088956149","https://openalex.org/W2100061495","https://openalex.org/W2103981148","https://openalex.org/W2122401586","https://openalex.org/W2128084896","https://openalex.org/W2161455936","https://openalex.org/W2610729871","https://openalex.org/W4233558979"],"related_works":["https://openalex.org/W1585007175","https://openalex.org/W2382521049","https://openalex.org/W2144385241","https://openalex.org/W4300101996","https://openalex.org/W4253593777","https://openalex.org/W2951497643","https://openalex.org/W2165950148","https://openalex.org/W3121712119","https://openalex.org/W2338854850","https://openalex.org/W2184239527"],"abstract_inverted_index":{"Many":[0],"algorithms":[1,42],"for":[2,140],"NP-hard":[3],"optimization":[4],"problems":[5,110,174],"find":[6],"solutions":[7,17],"that":[8,15,69,77,84,104,124,166],"are":[9,111,150,179],"locally":[10,35,86],"optimal,":[11],"in":[12,160,176],"the":[13,16,31,94,167,171],"sense":[14],"cannot":[18,125],"be":[19,126,158],"improved":[20,127],"by":[21,39,63,128],"a":[22,65,79,82,122,129,137,153],"polynomially":[23],"computable":[24],"perturbation.":[25],"Very":[26],"little":[27],"is":[28,85,98,101,164],"known":[29],"about":[30],"complexity":[32,66],"of":[33,81,132,170],"finding":[34,78,121,136],"optimal":[36,87],"solutions,":[37],"either":[38],"local":[40,71,108,154,172],"search":[41,72,109,173],"or":[43,147],"using":[44],"other":[45,148],"indirect":[46],"methods.":[47],"Johnson,":[48],"Papadimitriou,":[49],"and":[50,113,135],"Yannakakis":[51],"[J.":[52],"Comput.":[53],"System":[54],"Sci.,":[55],"37":[56],"(1988),":[57],"pp.":[58],"79\u2013100]":[59],"studied":[60,175],"this":[61,177],"question":[62],"defining":[64],"class":[67],"PLS":[68],"captures":[70],"problems.":[73],"It":[74,100,163],"was":[75],"proved":[76],"partition":[80,123],"graph":[83],"into":[88],"equal":[89],"parts":[90],"with":[91],"respect":[92],"to":[93],"acclaimed":[95],"Kernighan-Lin":[96],"algorithm":[97],"PLS-complete.":[99],"shown":[102,165],"here":[103],"several":[105],"natural,":[106],"simple":[107],"PLS-complete,":[112],"thus":[114],"just":[115],"as":[116],"hard.":[117],"Two":[118],"examples":[119],"are:":[120],"single":[130],"swap":[131],"two":[133],"vertices,":[134],"stable":[138],"configuration":[139],"an":[141],"undirected":[142],"connectionist":[143],"network.":[144],"When":[145],"edges":[146],"objects":[149],"unweighted,":[151],"then":[152],"optimum":[155],"can":[156],"always":[157],"found":[159],"polynomial":[161],"time.":[162],"unweighted":[168],"versions":[169],"paper":[178],"P-complete.":[180]},"counts_by_year":[{"year":2026,"cited_by_count":5},{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":8},{"year":2023,"cited_by_count":9},{"year":2022,"cited_by_count":11},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":14},{"year":2019,"cited_by_count":13},{"year":2018,"cited_by_count":9},{"year":2017,"cited_by_count":13},{"year":2016,"cited_by_count":10},{"year":2015,"cited_by_count":9},{"year":2014,"cited_by_count":12},{"year":2013,"cited_by_count":10},{"year":2012,"cited_by_count":11}],"updated_date":"2026-04-15T08:11:43.952461","created_date":"2025-10-10T00:00:00"}
