{"id":"https://openalex.org/W2102172432","doi":"https://doi.org/10.1142/s0218195910003232","title":"GENERALIZED WATCHMAN ROUTE PROBLEM WITH DISCRETE VIEW COST","display_name":"GENERALIZED WATCHMAN ROUTE PROBLEM WITH DISCRETE VIEW COST","publication_year":2010,"publication_date":"2010-04-01","ids":{"openalex":"https://openalex.org/W2102172432","doi":"https://doi.org/10.1142/s0218195910003232","mag":"2102172432"},"language":"en","primary_location":{"id":"doi:10.1142/s0218195910003232","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218195910003232","pdf_url":null,"source":{"id":"https://openalex.org/S25827807","display_name":"International Journal of Computational Geometry & Applications","issn_l":"0218-1959","issn":["0218-1959","1793-6357"],"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":"International Journal of Computational Geometry & 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/A5100724577","display_name":"Pengpeng Wang","orcid":"https://orcid.org/0000-0002-0307-8837"},"institutions":[{"id":"https://openalex.org/I18014758","display_name":"Simon Fraser University","ror":"https://ror.org/0213rcc28","country_code":"CA","type":"education","lineage":["https://openalex.org/I18014758"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"PENGPENG WANG","raw_affiliation_strings":["Robotic Algorithms and Motion Planning Laboratory, School of Engineering Science, Simon Fraser University, Burnaby, B.C., Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Robotic Algorithms and Motion Planning Laboratory, School of Engineering Science, Simon Fraser University, Burnaby, B.C., Canada","institution_ids":["https://openalex.org/I18014758"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014255932","display_name":"Ramesh Krishnamurti","orcid":"https://orcid.org/0000-0001-6327-8286"},"institutions":[{"id":"https://openalex.org/I18014758","display_name":"Simon Fraser University","ror":"https://ror.org/0213rcc28","country_code":"CA","type":"education","lineage":["https://openalex.org/I18014758"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"RAMESH KRISHNAMURTI","raw_affiliation_strings":["School of Computing Science, Simon Fraser University, Burnaby, B.C., Canada","School of Computing Science, Simon Fraser University, Burnaby B.C., Canada#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computing Science, Simon Fraser University, Burnaby, B.C., Canada","institution_ids":["https://openalex.org/I18014758"]},{"raw_affiliation_string":"School of Computing Science, Simon Fraser University, Burnaby B.C., Canada#TAB#","institution_ids":["https://openalex.org/I18014758"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5067371024","display_name":"Kamal Gupta","orcid":"https://orcid.org/0000-0002-4154-0615"},"institutions":[{"id":"https://openalex.org/I18014758","display_name":"Simon Fraser University","ror":"https://ror.org/0213rcc28","country_code":"CA","type":"education","lineage":["https://openalex.org/I18014758"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"KAMAL GUPTA","raw_affiliation_strings":["Robotic Algorithms and Motion Planning Laboratory, School of Engineering Science, Simon Fraser University, Burnaby, B.C., Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Robotic Algorithms and Motion Planning Laboratory, School of Engineering Science, Simon Fraser University, Burnaby, B.C., Canada","institution_ids":["https://openalex.org/I18014758"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I18014758"],"apc_list":null,"apc_paid":null,"fwci":1.4623,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.83646709,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"20","issue":"02","first_page":"119","last_page":"146"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9994999766349792,"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/T12288","display_name":"Optimization and Search Problems","score":0.9994999766349792,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9954000115394592,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9944999814033508,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/polygon","display_name":"Polygon (computer graphics)","score":0.7893964052200317},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6424256563186646},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5504691004753113},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5211639404296875},{"id":"https://openalex.org/keywords/boundary","display_name":"Boundary (topology)","score":0.4673123061656952},{"id":"https://openalex.org/keywords/viewpoints","display_name":"Viewpoints","score":0.4660400450229645},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4567561745643616},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4035138487815857},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3589736819267273},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3480331301689148},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.29473525285720825}],"concepts":[{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.7893964052200317},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6424256563186646},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5504691004753113},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5211639404296875},{"id":"https://openalex.org/C62354387","wikidata":"https://www.wikidata.org/wiki/Q875399","display_name":"Boundary (topology)","level":2,"score":0.4673123061656952},{"id":"https://openalex.org/C2776035091","wikidata":"https://www.wikidata.org/wiki/Q7928819","display_name":"Viewpoints","level":2,"score":0.4660400450229645},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4567561745643616},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4035138487815857},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3589736819267273},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3480331301689148},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.29473525285720825},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C126042441","wikidata":"https://www.wikidata.org/wiki/Q1324888","display_name":"Frame (networking)","level":2,"score":0.0},{"id":"https://openalex.org/C153349607","wikidata":"https://www.wikidata.org/wiki/Q36649","display_name":"Visual arts","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0218195910003232","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218195910003232","pdf_url":null,"source":{"id":"https://openalex.org/S25827807","display_name":"International Journal of Computational Geometry & Applications","issn_l":"0218-1959","issn":["0218-1959","1793-6357"],"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":"International Journal of Computational Geometry & Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.7699999809265137}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W147753017","https://openalex.org/W206299574","https://openalex.org/W1520744620","https://openalex.org/W1966360761","https://openalex.org/W1971836159","https://openalex.org/W1981988453","https://openalex.org/W1989723858","https://openalex.org/W2004826883","https://openalex.org/W2008110774","https://openalex.org/W2008416425","https://openalex.org/W2010226110","https://openalex.org/W2020643009","https://openalex.org/W2024693023","https://openalex.org/W2028769163","https://openalex.org/W2050037634","https://openalex.org/W2052861240","https://openalex.org/W2055569927","https://openalex.org/W2063442090","https://openalex.org/W2065732902","https://openalex.org/W2092705708","https://openalex.org/W2108567935","https://openalex.org/W2112346596","https://openalex.org/W2129879687","https://openalex.org/W2143731699","https://openalex.org/W2157638946","https://openalex.org/W2158652185","https://openalex.org/W2406507196","https://openalex.org/W2506642202","https://openalex.org/W2610052675","https://openalex.org/W2611804663","https://openalex.org/W2951420174","https://openalex.org/W2982209274","https://openalex.org/W4298410530"],"related_works":["https://openalex.org/W2385368906","https://openalex.org/W2370332886","https://openalex.org/W3042074040","https://openalex.org/W2804118840","https://openalex.org/W2962917430","https://openalex.org/W2028468530","https://openalex.org/W4299801389","https://openalex.org/W2574604093","https://openalex.org/W2775068415","https://openalex.org/W1903284337"],"abstract_inverted_index":{"In":[0],"this":[1,93],"paper,":[2],"we":[3,138,183],"introduce":[4],"a":[5,20,25,31,68,105,142,215,219],"generalized":[6],"version":[7,113],"of":[8,33,71,79,88,114,150,161,200,210,221],"the":[9,15,37,45,72,77,82,85,89,95,101,154,159,167,198,202,207],"Watchman":[10,97],"Route":[11,98],"Problem":[12,99,171],"(WRP)":[13],"where":[14,116,156],"objective":[16],"is":[17,48,67,120,158,225],"to":[18,65,76],"plan":[19],"continuous":[21],"closed":[22],"route":[23,39],"in":[24,153,185,197],"polygon":[26,46,118,162,216],"(possibly":[27],"with":[28,172],"holes)":[29],"and":[30,81,111,164,175],"set":[32],"discrete":[34],"viewpoints":[35,152,212],"on":[36,44],"planned":[38,56,127],"such":[40],"that":[41,144,190,213],"every":[42],"point":[43],"boundary":[47],"visible":[49,122],"from":[50,123],"at":[51,124],"least":[52,125],"one":[53,126],"viewpoint.":[54,128],"Each":[55],"viewpoint":[57],"has":[58,193],"some":[59],"associated":[60],"cost.":[61],"The":[62,136],"total":[63,86],"cost":[64],"minimize":[66],"weighted":[69],"sum":[70],"view":[73,203],"cost,":[74,84],"proportional":[75],"number":[78,149,160,209],"viewpoints,":[80],"travel":[83],"length":[87],"route.":[90],"We":[91,103,129,188],"call":[92,130],"problem":[94],"Generalized":[96],"or":[100,218],"GWRP.":[102,135],"tackle":[104],"restricted":[106],"nontrivial":[107],"(it":[108],"remains":[109],"NP-hard":[110],"log-inapproximable)":[112],"GWRP":[115],"each":[117],"edge":[119],"entirely":[121],"it":[131],"Whole":[132],"Edge":[133],"Covering":[134],"algorithm":[137,182,192],"propose":[139],"first":[140],"constructs":[141],"graph":[143],"connects":[145],"O(n":[146],"12":[147],")":[148],"sample":[151,211],"polygon,":[155],"n":[157],"vertices;":[163],"then":[165],"solves":[166],"corresponding":[168],"View":[169,174],"Planning":[170],"Combined":[173],"Traveling":[176],"Cost,":[177],"using":[178],"an":[179,194],"LP-relaxation":[180],"based":[181],"introduced":[184],"[27,":[186],"29].":[187],"show":[189],"our":[191],"approximation":[195],"ratio":[196],"order":[199],"either":[201],"frequency,":[204],"defined":[205],"as":[206],"maximum":[208],"cover":[214],"edge,":[217],"polynomial":[220],"log":[222],"n,":[223],"whichever":[224],"smaller.":[226]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}