Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

The robber route problem

From MaRDI portal
Publication:909464
Jump to:navigation, search

DOI10.1016/0020-0190(90)90137-MzbMath0694.68037MaRDI QIDQ909464

Simeon C. Ntafos

Publication date: 1990

Published in: Information Processing Letters (Search for Journal in Brave)


zbMATH Keywords

path planningroboticsvisibilitycomputational geometrywatchman routes


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computing methodologies and applications (68U99) Convex sets in (2) dimensions (including convex curves) (52A10)


Related Items (2)

Watchman routes under limited visibility ⋮ The zookeeper route problem



Cites Work

  • Shortest watchman routes in simple polygons
  • Optimum watchman routes
  • Unnamed Item
  • Unnamed Item


This page was built for publication: The robber route problem

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:909464&oldid=12874437"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 16:59.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki