{"id":"https://openalex.org/W2739911153","doi":null,"title":"On the problem of computing zookeeper routes","display_name":"On the problem of computing zookeeper routes","alternate_titles":[],"publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W2739911153","mag":"2739911153"},"language":"en","primary_location":{"id":"pmh:oai:DiVA.org:ltu-24344","doi":null,"is_oa":true,"landing_page_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-24344","pdf_url":null,"source":{"id":"https://openalex.org/S7407055297","display_name":"DiVA (Lule\u00e5 University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I190632392","host_organization_name":"Lule\u00e5 University of Technology","host_organization_lineage":["https://openalex.org/I190632392"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/report"},"parent_works":[],"lineage":["https://openalex.org/W2739911153"],"child_works_count":0,"type":"report","is_traditional":false,"indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-24344","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"H\u00e5kan J\u00f6nsson","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"H\u00e5kan J\u00f6nsson","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5016644938","display_name":"Sofia Sundberg","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Sofia Sundberg","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9965999722480774,"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.9965999722480774,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.003000000026077032,"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"}},{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":9.999999747378752e-05,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/shortest-path","display_name":"shortest path","score":0.6629999876022339},{"id":"https://openalex.org/keywords/simple-polygons","display_name":"simple polygons","score":0.8240000009536743},{"id":"https://openalex.org/keywords/convex-polygons","display_name":"convex polygons","score":0.7509999871253967},{"id":"https://openalex.org/keywords/closed-paths","display_name":"closed paths","score":0.39899998903274536},{"id":"https://openalex.org/keywords/exact-algorithms","display_name":"exact algorithms","score":0.5440000295639038},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.9729999899864197},{"id":"https://openalex.org/keywords/computational-geometry","display_name":"computational geometry","score":0.6320000290870667},{"id":"https://openalex.org/keywords/numerical-stability","display_name":"numerical stability","score":0.4519999921321869}],"concepts":[{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6012334823608398},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.579024076461792},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.508089542388916},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4876753091812134},{"id":"https://openalex.org/C520416788","wikidata":"https://www.wikidata.org/wiki/Q5419229","display_name":"Exact solutions in general relativity","level":2,"score":0.4605265259742737},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43896132707595825},{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.42830368876457214},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.42385903000831604},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.41277262568473816},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.41256576776504517},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.38901621103286743},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3352900743484497},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0859900712966919},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.07012411952018738},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"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}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:DiVA.org:ltu-24344","doi":null,"is_oa":true,"landing_page_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-24344","pdf_url":null,"source":{"id":"https://openalex.org/S7407055297","display_name":"DiVA (Lule\u00e5 University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I190632392","host_organization_name":"Lule\u00e5 University of Technology","host_organization_lineage":["https://openalex.org/I190632392"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/report"},{"id":"mag:2739911153","doi":null,"is_oa":false,"landing_page_url":"http://www.diva-portal.org/smash/record.jsf?pid=diva2:997396","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.100.6566","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.100.6566","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://epubl.ltu.se/1402-1528/2004/10/LTU-FR-0410-SE.pdf","raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:DiVA.org:ltu-24344","doi":null,"is_oa":true,"landing_page_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-24344","pdf_url":null,"source":{"id":"https://openalex.org/S7407055297","display_name":"DiVA (Lule\u00e5 University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I190632392","host_organization_name":"Lule\u00e5 University of Technology","host_organization_lineage":["https://openalex.org/I190632392"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/report"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2739911153.pdf","grobid_xml":"https://content.openalex.org/works/W2739911153.grobid-xml"},"referenced_works_count":14,"referenced_works":["https://openalex.org/W115685709","https://openalex.org/W594514321","https://openalex.org/W1557760894","https://openalex.org/W1602850305","https://openalex.org/W1858540722","https://openalex.org/W1988912457","https://openalex.org/W2028875546","https://openalex.org/W2052861240","https://openalex.org/W2059238087","https://openalex.org/W2064191526","https://openalex.org/W2066658205","https://openalex.org/W2129879687","https://openalex.org/W2501762734","https://openalex.org/W4385265211"],"related_works":["https://openalex.org/W2059238087","https://openalex.org/W3014477668","https://openalex.org/W2064191526","https://openalex.org/W2028875546","https://openalex.org/W2052861240","https://openalex.org/W119726163","https://openalex.org/W2887762326","https://openalex.org/W2046419297","https://openalex.org/W7099915388"],"abstract_inverted_index":{"The":[0,50],"Zookeeper's":[1,104],"Problem":[2],"is":[3],"a":[4,9,15,31,97],"shortest-path":[5],"problem":[6,59],"that,":[7],"given":[8],"simple":[10],"polygon":[11],"(a":[12],"zoo)":[13],"containing":[14],"set":[16],"of":[17,26,43,57,61,85,99,107,139],"disjoint":[18],"convex":[19],"polygons":[20],"(cages)":[21],"attached":[22],"to":[23],"the":[24,27,37,41,82,86,103,113,122,125,140],"boundary":[25],"zoo,":[28],"asks":[29],"for":[30,55,102],"shortest":[32],"route":[33],"(closed":[34],"path)":[35],"in":[36,142],"zoo":[38],"that":[39,88],"intersects":[40],"boundaries":[42],"all":[44],"cages":[45],"without":[46],"entering":[47],"their":[48],"interiors.":[49],"literature":[51],"contains":[52],"several":[53],"algorithms":[54,87,101,123,141],"variants":[56],"this":[58,93],"some":[60,66],"which":[62],"compute":[63,89,109],"exact":[64,90,110],"and":[65,112,124],"approximate":[67],"solutions.":[68,91],"However,":[69],"no":[70],"implementations":[71],"have":[72,77],"been":[73,79],"reported.":[74],"Moreover,":[75],"concerns":[76],"also":[78,130],"raised":[80],"about":[81,121],"numerical":[83],"properties":[84],"In":[92],"paper":[94],"we":[95],"present":[96,131],"study":[98,134],"two":[100],"Problem.":[105],"One":[106],"them":[108],"solutions":[111,126],"other":[114],"provably":[115],"good":[116],"approximations.":[117],"We":[118,129],"give":[119],"observations":[120],"they":[127],"compute.":[128],"an":[132,137],"experimental":[133],"based":[135],"on":[136],"implementation":[138],"Java.":[143]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2739911153","counts_by_year":[],"updated_date":"2026-11-21T10:27:49.728292","created_date":"2017-08-08T00:00:00"}
