{"id":"https://openalex.org/W3182052790","doi":"https://doi.org/10.1142/s1793830922500550","title":"Minimum constraint removal problem for line segments is NP-hard","display_name":"Minimum constraint removal problem for line segments is NP-hard","publication_year":2022,"publication_date":"2022-01-12","ids":{"openalex":"https://openalex.org/W3182052790","doi":"https://doi.org/10.1142/s1793830922500550","mag":"3182052790"},"language":"en","primary_location":{"id":"doi:10.1142/s1793830922500550","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830922500550","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","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/A5058878172","display_name":"Bahram Sadeghi Bigham","orcid":"https://orcid.org/0000-0003-3387-3193"},"institutions":[{"id":"https://openalex.org/I161028277","display_name":"Institute for Advanced Studies in Basic Sciences","ror":"https://ror.org/00bzsst90","country_code":"IR","type":"education","lineage":["https://openalex.org/I161028277"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"Bahram Sadeghi Bigham","raw_affiliation_strings":["Department of Computer Science and Information Technology, Institute for Advanced Studies in Basic Sciences (IASBS), Zanjan, Iran"],"raw_orcid":"https://orcid.org/0000-0003-3387-3193","affiliations":[{"raw_affiliation_string":"Department of Computer Science and Information Technology, Institute for Advanced Studies in Basic Sciences (IASBS), Zanjan, Iran","institution_ids":["https://openalex.org/I161028277"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5058878172"],"corresponding_institution_ids":["https://openalex.org/I161028277"],"apc_list":null,"apc_paid":null,"fwci":0.367,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.62511259,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"15","issue":"01","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9646000266075134,"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/constraint","display_name":"Constraint (computer-aided design)","score":0.6754648685455322},{"id":"https://openalex.org/keywords/line-segment","display_name":"Line segment","score":0.6495004296302795},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5902956128120422},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.5855082869529724},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5707598924636841},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5594186186790466},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5542270541191101},{"id":"https://openalex.org/keywords/line","display_name":"Line (geometry)","score":0.5493854284286499},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5336606502532959},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.49062076210975647},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.46287253499031067},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2681810259819031},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.08872422575950623}],"concepts":[{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.6754648685455322},{"id":"https://openalex.org/C182124507","wikidata":"https://www.wikidata.org/wiki/Q166154","display_name":"Line segment","level":2,"score":0.6495004296302795},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5902956128120422},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.5855082869529724},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5707598924636841},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5594186186790466},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5542270541191101},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.5493854284286499},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5336606502532959},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.49062076210975647},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.46287253499031067},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2681810259819031},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.08872422575950623},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"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.1142/s1793830922500550","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830922500550","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","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":13,"referenced_works":["https://openalex.org/W1434156133","https://openalex.org/W1517593500","https://openalex.org/W1537778554","https://openalex.org/W1817769608","https://openalex.org/W1935837271","https://openalex.org/W2023862787","https://openalex.org/W2035530212","https://openalex.org/W2101993361","https://openalex.org/W2290639523","https://openalex.org/W2294997557","https://openalex.org/W2540258482","https://openalex.org/W2990799558","https://openalex.org/W4240202985"],"related_works":["https://openalex.org/W4386442742","https://openalex.org/W2353000084","https://openalex.org/W4205730002","https://openalex.org/W2942906518","https://openalex.org/W1623138178","https://openalex.org/W4288363470","https://openalex.org/W2357946356","https://openalex.org/W180294324","https://openalex.org/W2353540264","https://openalex.org/W3084509788"],"abstract_inverted_index":{"In":[0,81],"the":[1,20,23,73,97],"minimum":[2,24],"constraint":[3],"removal":[4],"([Formula:":[5],"see":[6,42],"text]),":[7],"there":[8],"is":[9,45,75,99],"no":[10],"feasible":[11],"path":[12],"to":[13,31],"move":[14],"from":[15,87],"a":[16,33,64,85],"starting":[17],"point":[18],"towards":[19],"goal,":[21],"and":[22,72,104],"constraints":[25,48,69],"should":[26],"be":[27],"removed":[28],"in":[29,56,91],"order":[30],"find":[32],"collision-free":[34],"path.":[35],"It":[36],"has":[37,63],"been":[38],"proved":[39],"that":[40,96],"[Formula:":[41],"text]":[43],"problem":[44,74,98],"NP-hard":[46,100],"when":[47,68],"have":[49],"arbitrary":[50],"shapes":[51],"or":[52],"even":[53],"they":[54],"are":[55,70],"shape":[57],"of":[58],"convex":[59],"polygons.":[60],"However,":[61],"it":[62],"simple":[65],"linear":[66],"solution":[67],"lines":[71],"open":[76],"for":[77,101],"other":[78],"cases":[79],"yet.":[80],"this":[82],"paper,":[83],"using":[84],"reduction":[86],"Subset":[88],"Sum":[89],"problem,":[90],"three":[92],"steps,":[93],"we":[94],"show":[95],"both":[102],"weighted":[103],"unweighted":[105],"line":[106],"segments.":[107]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2021-07-19T00:00:00"}