{"id":"https://openalex.org/W4293235042","doi":"https://doi.org/10.1142/s179383092250063x","title":"Hardness of uncertain segment cover, contiguous SAT and visibility with uncertain obstacles","display_name":"Hardness of uncertain segment cover, contiguous SAT and visibility with uncertain obstacles","publication_year":2022,"publication_date":"2022-04-22","ids":{"openalex":"https://openalex.org/W4293235042","doi":"https://doi.org/10.1142/s179383092250063x"},"language":"en","primary_location":{"id":"doi:10.1142/s179383092250063x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s179383092250063x","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/A5041521633","display_name":"Sharareh Alipour","orcid":"https://orcid.org/0000-0002-3626-8960"},"institutions":[{"id":"https://openalex.org/I4210146419","display_name":"Institute for Research in Fundamental Sciences","ror":"https://ror.org/04xreqs31","country_code":"IR","type":"facility","lineage":["https://openalex.org/I4210146419"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"Sharareh Alipour","raw_affiliation_strings":["School of Computer Science, Institute for Research in Fundamental Sciences (IPM), Iran"],"affiliations":[{"raw_affiliation_string":"School of Computer Science, Institute for Research in Fundamental Sciences (IPM), Iran","institution_ids":["https://openalex.org/I4210146419"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046936463","display_name":"Salman Parsa","orcid":"https://orcid.org/0000-0002-8179-9322"},"institutions":[{"id":"https://openalex.org/I47838141","display_name":"Saint Louis University","ror":"https://ror.org/01p7jjy08","country_code":"US","type":"education","lineage":["https://openalex.org/I47838141"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Salman Parsa","raw_affiliation_strings":["Computer Science Department, Saint Louis University, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Saint Louis University, USA","institution_ids":["https://openalex.org/I47838141"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5041521633"],"corresponding_institution_ids":["https://openalex.org/I4210146419"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.17774282,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"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.9986000061035156,"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.9986000061035156,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9969000220298767,"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.9969000220298767,"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/cover","display_name":"Cover (algebra)","score":0.8315663933753967},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6820151805877686},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6113964319229126},{"id":"https://openalex.org/keywords/visibility","display_name":"Visibility","score":0.5832881927490234},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.5745642185211182},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.55185866355896},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5324769020080566},{"id":"https://openalex.org/keywords/literal","display_name":"Literal (mathematical logic)","score":0.5278239846229553},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.42261889576911926},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.34549421072006226},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.31092095375061035},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.245265930891037},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.11003062129020691}],"concepts":[{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.8315663933753967},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6820151805877686},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6113964319229126},{"id":"https://openalex.org/C123403432","wikidata":"https://www.wikidata.org/wiki/Q654068","display_name":"Visibility","level":2,"score":0.5832881927490234},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.5745642185211182},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.55185866355896},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5324769020080566},{"id":"https://openalex.org/C2780882242","wikidata":"https://www.wikidata.org/wiki/Q14235582","display_name":"Literal (mathematical logic)","level":2,"score":0.5278239846229553},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.42261889576911926},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34549421072006226},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.31092095375061035},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.245265930891037},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.11003062129020691},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s179383092250063x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s179383092250063x","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":[{"score":0.5,"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities"}],"awards":[{"id":"https://openalex.org/G6562112540","display_name":null,"funder_award_id":"CCF-1614562","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W35252975","https://openalex.org/W1825136300","https://openalex.org/W1965466436","https://openalex.org/W1985123706","https://openalex.org/W1986642089","https://openalex.org/W1999032440","https://openalex.org/W2003979824","https://openalex.org/W2007385106","https://openalex.org/W2018025029","https://openalex.org/W2038225707","https://openalex.org/W2059030232","https://openalex.org/W2066372981","https://openalex.org/W2066577300","https://openalex.org/W2085486788","https://openalex.org/W2088617781","https://openalex.org/W2094658339","https://openalex.org/W2132339863","https://openalex.org/W2136023420","https://openalex.org/W2152986618","https://openalex.org/W2155406096","https://openalex.org/W2171922321","https://openalex.org/W2803489765","https://openalex.org/W2911942690"],"related_works":["https://openalex.org/W2056597184","https://openalex.org/W1712180277","https://openalex.org/W1608414128","https://openalex.org/W2029933769","https://openalex.org/W2094388041","https://openalex.org/W3102280101","https://openalex.org/W2538178083","https://openalex.org/W159504299","https://openalex.org/W1968988491","https://openalex.org/W1545220528"],"abstract_inverted_index":{"In":[0,84],"this":[1,66,133],"paper,":[2],"we":[3,79],"prove":[4,108],"that":[5,65,78,102,109,121],"the":[6,22,30,37,75,122],"uncertain":[7,14,40,54,123],"segment":[8,15,28,124],"cover":[9,16,125],"problem":[10,67,77,88,112,126,134],"is":[11,61,68,99,113,127],"NP-hard.":[12,128],"The":[13,129],"problem,":[17],"which":[18],"appears":[19,105],"in":[20,29,36],"solving":[21],"question":[23],"of":[24,26,39,53,74,132],"visibility":[25],"a":[27,33,44,51,71,85,89,93,117],"plane":[31],"from":[32],"given":[34,45,94,100],"point":[35],"presence":[38],"obstacles,":[41],"asks":[42],"if":[43],"interval":[46],"can":[47],"be":[48],"covered":[49],"by":[50,63],"collection":[52],"sub-intervals":[55],"having":[56],"two":[57],"possible":[58],"positions.":[59],"This":[60],"done":[62],"showing":[64],"equivalent":[69],"to":[70],"special":[72],"version":[73],"SAT":[76,87,111],"will":[80],"call":[81],"contiguous":[82,86,110],"SAT.":[83],"CNF":[90],"formula":[91],"with":[92],"ordering":[95],"on":[96],"its":[97,136],"clauses":[98],"such":[101],"any":[103],"literal":[104],"contiguously.":[106],"We":[107],"NP-hard":[114],"and":[115,135],"as":[116],"consequence":[118],"it":[119],"follows":[120],"approximation":[130],"solution":[131],"hardness":[137],"are":[138],"also":[139],"studied.":[140]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}