{"id":"https://openalex.org/W7163903371","doi":"https://doi.org/10.4230/lipics.swat.2026.11","title":"Improved Approximation of Two Watchmen\u2019s Routes in Simple Polygons","display_name":"Improved Approximation of Two Watchmen\u2019s Routes in Simple Polygons","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7163903371","doi":"https://doi.org/10.4230/lipics.swat.2026.11"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26047","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2026.11","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol370-swat2026/LIPIcs.SWAT.2026.11/LIPIcs.SWAT.2026.11.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol370-swat2026/LIPIcs.SWAT.2026.11/LIPIcs.SWAT.2026.11.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5138154740","display_name":"Anna Br\u00f6tzner","orcid":"https://orcid.org/0000-0002-2161-6571"},"institutions":[{"id":"https://openalex.org/I183111857","display_name":"Malm\u00f6 University","ror":"https://ror.org/05wp7an13","country_code":"SE","type":"education","lineage":["https://openalex.org/I183111857"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Br\u00f6tzner, Anna","raw_affiliation_strings":["Faculty of Technology and Society, Malm\u00f6 University, Sweden"],"raw_orcid":"https://orcid.org/0000-0002-2161-6571","affiliations":[{"raw_affiliation_string":"Faculty of Technology and Society, Malm\u00f6 University, Sweden","institution_ids":["https://openalex.org/I183111857"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101713320","display_name":"Bengt J. Nilsson","orcid":"https://orcid.org/0000-0002-1342-8618"},"institutions":[{"id":"https://openalex.org/I183111857","display_name":"Malm\u00f6 University","ror":"https://ror.org/05wp7an13","country_code":"SE","type":"education","lineage":["https://openalex.org/I183111857"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Nilsson, Bengt J.","raw_affiliation_strings":["Faculty of Technology and Society, Malm\u00f6 University, Sweden"],"raw_orcid":"https://orcid.org/0000-0002-1342-8618","affiliations":[{"raw_affiliation_string":"Faculty of Technology and Society, Malm\u00f6 University, Sweden","institution_ids":["https://openalex.org/I183111857"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072597371","display_name":"Christiane Schmidt","orcid":"https://orcid.org/0000-0003-2548-5756"},"institutions":[{"id":"https://openalex.org/I102134673","display_name":"Link\u00f6ping University","ror":"https://ror.org/05ynxx418","country_code":"SE","type":"education","lineage":["https://openalex.org/I102134673"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Schmidt, Christiane","raw_affiliation_strings":["Department of Science and Technology, Link\u00f6ping University, Sweden"],"raw_orcid":"https://orcid.org/0000-0003-2548-5756","affiliations":[{"raw_affiliation_string":"Department of Science and Technology, Link\u00f6ping University, Sweden","institution_ids":["https://openalex.org/I102134673"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.97288748,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"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.2872999906539917,"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.2872999906539917,"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.2687000036239624,"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/T11106","display_name":"Data Management and Algorithms","score":0.08980000019073486,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/approximation-algorithm","display_name":"Approximation algorithm","score":0.7508000135421753},{"id":"https://openalex.org/keywords/polygon","display_name":"Polygon (computer graphics)","score":0.6146000027656555},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.539900004863739},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5052000284194946},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4975999891757965},{"id":"https://openalex.org/keywords/approximation-theory","display_name":"Approximation theory","score":0.4691999852657318},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.3644999861717224}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7508000135421753},{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.6146000027656555},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.555899977684021},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.539900004863739},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5052000284194946},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4975999891757965},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4968000054359436},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4918000102043152},{"id":"https://openalex.org/C145242015","wikidata":"https://www.wikidata.org/wiki/Q774123","display_name":"Approximation theory","level":2,"score":0.4691999852657318},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.3644999861717224},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3255999982357025},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3147999942302704},{"id":"https://openalex.org/C122383733","wikidata":"https://www.wikidata.org/wiki/Q865920","display_name":"Approximation error","level":2,"score":0.3147999942302704},{"id":"https://openalex.org/C117148685","wikidata":"https://www.wikidata.org/wiki/Q6865376","display_name":"Minimax approximation algorithm","level":2,"score":0.3125999867916107},{"id":"https://openalex.org/C97542219","wikidata":"https://www.wikidata.org/wiki/Q497863","display_name":"SIMPLE algorithm","level":2,"score":0.30959999561309814},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.30219998955726624},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.3018999993801117},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.2793999910354614},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.2567000091075897},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.2540999948978424},{"id":"https://openalex.org/C63548660","wikidata":"https://www.wikidata.org/wiki/Q858223","display_name":"Limit point","level":2,"score":0.2515000104904175},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.25040000677108765}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:26047","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2026.11","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol370-swat2026/LIPIcs.SWAT.2026.11/LIPIcs.SWAT.2026.11.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},{"id":"doi:10.4230/lipics.swat.2026.11","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.swat.2026.11","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26047","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2026.11","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol370-swat2026/LIPIcs.SWAT.2026.11/LIPIcs.SWAT.2026.11.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7163903371.pdf","grobid_xml":"https://content.openalex.org/works/W7163903371.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,54,90],"study":[1],"the":[2,13,17,20,50,85,92,98,115,147,171],"watchman":[3],"route":[4,22],"problem":[5,59],"for":[6,12,82],"a":[7,25,43,79],"set":[8,45],"of":[9,15,19,46,52,84,97,100,125,163],"two":[10,86],"watchmen":[11],"objective":[14],"minimizing":[16],"length":[18],"longest":[21],"(min-max)":[23],"inside":[24],"simple":[26],"polygon":[27],"P":[28,101],"having":[29,182],"n":[30],"vertices,":[31],"which":[32],"is":[33,60,88],"known":[34,117,173],"to":[35,94,142,146],"be":[36],"weakly":[37,61],"NP-hard.":[38],"First,":[39],"we":[40,139],"consider":[41],"seeing":[42],"discrete":[44],"m":[47],"points":[48,152],"in":[49,74,102],"interior":[51,99],"P.":[53],"show":[55],"that":[56,72,78,120],"even":[57],"this":[58,144,155],"NP-hard":[62],"and":[63,128,134,188],"present":[64],"an":[65,122,160],"approximation":[66,69,106,123,161,175],"algorithm":[67,93,119,145,176],"with":[68,105,177],"ratio":[70,107,124,162,178],"2+\u03b5":[71],"runs":[73],"O(m\u2075n)":[75],"time,":[76,158],"assuming":[77],"starting":[80,151],"point":[81],"each":[83],"routes":[87],"given.":[89],"generalize":[91],"see":[95],"all":[96],"O(n\u2076)":[103],"time":[104],"2":[108],"+":[109,165],"\u03c0/2":[110,166],"\u2248":[111,126,167,179],"3.571,":[112],"improving":[113,169],"on":[114,170],"previously":[116,172],"best":[118,174],"has":[121],"6.922":[127],"runtime":[129,183],"O(n\u00b2)":[130],"[Bengt":[131,185],"J.":[132,186],"Nilsson":[133,187],"Eli":[135,189],"Packer,":[136,190],"2024].":[137,191],"Finally,":[138],"describe":[140],"how":[141],"extend":[143],"case":[148],"where":[149],"no":[150],"are":[153],"given,":[154],"taking":[156],"O(n\u2078)":[157,184],"yielding":[159],"3":[164],"4.571,":[168],"5.969":[180],"also":[181]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-06-09T00:00:00"}