{"id":"https://openalex.org/W2105739218","doi":"https://doi.org/10.1137/s0097539704446384","title":"A Constant\u2010Factor Approximation Algorithm for Optimal 1.5D Terrain Guarding","display_name":"A Constant\u2010Factor Approximation Algorithm for Optimal 1.5D Terrain Guarding","publication_year":2007,"publication_date":"2007-01-01","ids":{"openalex":"https://openalex.org/W2105739218","doi":"https://doi.org/10.1137/s0097539704446384","mag":"2105739218"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539704446384","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539704446384","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/A5057627211","display_name":"Boaz Ben\u2010Moshe","orcid":"https://orcid.org/0000-0002-1580-5421"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Boaz Ben\u2010Moshe","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5104278282","display_name":"Matthew J. Katz","orcid":"https://orcid.org/0000-0002-5971-6746"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Matthew J. Katz","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5015247956","display_name":"Joseph S. B. Mitchell","orcid":"https://orcid.org/0000-0002-0152-2279"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Joseph S. B. Mitchell","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":7.5194,"has_fulltext":false,"cited_by_count":51,"citation_normalized_percentile":{"value":0.96594473,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"36","issue":"6","first_page":"1631","last_page":"1647"},"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.9995999932289124,"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.9995999932289124,"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.9958999752998352,"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/T12546","display_name":"Smart Parking Systems Research","score":0.9384999871253967,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"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/approximation-algorithm","display_name":"Approximation algorithm","score":0.7820418477058411},{"id":"https://openalex.org/keywords/terrain","display_name":"Terrain","score":0.7326146364212036},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.6686713099479675},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5972332954406738},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5413886904716492},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5274280309677124},{"id":"https://openalex.org/keywords/guard","display_name":"Guard (computer science)","score":0.5043946504592896},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.48016706109046936},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.4614298343658447},{"id":"https://openalex.org/keywords/factor","display_name":"Factor (programming language)","score":0.44211941957473755},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.44143056869506836},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3854232430458069},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3449423611164093},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.15983012318611145},{"id":"https://openalex.org/keywords/geography","display_name":"Geography","score":0.0723639726638794}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7820418477058411},{"id":"https://openalex.org/C161840515","wikidata":"https://www.wikidata.org/wiki/Q186131","display_name":"Terrain","level":2,"score":0.7326146364212036},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.6686713099479675},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5972332954406738},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5413886904716492},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5274280309677124},{"id":"https://openalex.org/C141141315","wikidata":"https://www.wikidata.org/wiki/Q2379942","display_name":"Guard (computer science)","level":2,"score":0.5043946504592896},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48016706109046936},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.4614298343658447},{"id":"https://openalex.org/C2781039887","wikidata":"https://www.wikidata.org/wiki/Q1391724","display_name":"Factor (programming language)","level":2,"score":0.44211941957473755},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.44143056869506836},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3854232430458069},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3449423611164093},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.15983012318611145},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0723639726638794},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"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/C58640448","wikidata":"https://www.wikidata.org/wiki/Q42515","display_name":"Cartography","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539704446384","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539704446384","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":6,"referenced_works":["https://openalex.org/W1973307935","https://openalex.org/W1981988453","https://openalex.org/W2022671649","https://openalex.org/W2060049097","https://openalex.org/W2065732902","https://openalex.org/W2116854100"],"related_works":["https://openalex.org/W2147086810","https://openalex.org/W4244934433","https://openalex.org/W4376639562","https://openalex.org/W1594413663","https://openalex.org/W1496354680","https://openalex.org/W2952847377","https://openalex.org/W2782292024","https://openalex.org/W2019216770","https://openalex.org/W1517616038","https://openalex.org/W2794433803"],"abstract_inverted_index":{"We":[0],"present":[1],"the":[2,12,28,41,62],"first":[3],"constant\u2010factor":[4],"approximation":[5,72],"algorithm":[6,25],"for":[7,26],"a":[8,33,69],"nontrivial":[9],"instance":[10],"of":[11,40,65],"optimal":[13],"guarding":[14],"(coverage)":[15],"problem":[16],"in":[17],"polygons.":[18],"In":[19],"particular,":[20],"we":[21],"give":[22],"an":[23],"$O(1)$\u2010approximation":[24],"placing":[27],"fewest":[29],"point":[30,39],"guards":[31],"on":[32],"1.5D":[34],"terrain,":[35],"so":[36],"that":[37],"every":[38],"terrain":[42],"is":[43],"seen":[44],"by":[45],"at":[46],"least":[47],"one":[48],"guard.":[49],"While":[50],"polylogarithmic\u2010factor":[51],"approximations":[52],"follow":[53],"from":[54],"set":[55],"cover":[56],"results,":[57],"our":[58],"new":[59],"results":[60],"exploit":[61],"geometric":[63],"structure":[64],"terrains":[66],"to":[67],"obtain":[68],"substantially":[70],"improved":[71],"algorithm.":[73]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}