A 2-approximation algorithm for the zookeeper's problem (Q845863): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An O\((n\log n)\) algorithm for the zoo-keeper's problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangulating a simple polygon in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest watchman routes in simple polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: The zookeeper route problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximative solution to the Zookeeper's problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest zookeeper's routes in simple polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast computation of shortest watchman routes in simple polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding shortest safari routes in simple polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for the watchman route and zookeeper's problems. / rank
 
Normal rank

Latest revision as of 10:57, 2 July 2024

scientific article
Language Label Description Also known as
English
A 2-approximation algorithm for the zookeeper's problem
scientific article

    Statements