Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Watchman_route_problem> ?p ?o }
Showing triples 1 to 26 of
26
with 100 triples per page.
- Watchman_route_problem abstract "The Watchman Problem is an optimization problem in computational geometry where the objective is to compute the shortest route a watchman should take to guard an entire area with obstacles given only a map of the area. The challenge is to make sure the watchman peeks behind every corner and to determine the best order in which corners should be visited in. The problem may be solved in polynomial time when the area to be guarded is a simple polygon. The problem is NP-hard for polygons with holes, but may be approximated in polynomial time by a solution whose length is within a polylogarithmic factor of optimal.".
- Watchman_route_problem wikiPageID "2997527".
- Watchman_route_problem wikiPageLength "2234".
- Watchman_route_problem wikiPageOutDegree "7".
- Watchman_route_problem wikiPageRevisionID "622025012".
- Watchman_route_problem wikiPageWikiLink Art_gallery_problem.
- Watchman_route_problem wikiPageWikiLink Category:Geometric_algorithms.
- Watchman_route_problem wikiPageWikiLink Computational_geometry.
- Watchman_route_problem wikiPageWikiLink Mathematical_optimization.
- Watchman_route_problem wikiPageWikiLink NP-hardness.
- Watchman_route_problem wikiPageWikiLink Simple_polygon.
- Watchman_route_problem wikiPageWikiLink Time_complexity.
- Watchman_route_problem wikiPageWikiLinkText "Watchman route problem".
- Watchman_route_problem wikiPageUsesTemplate Template:Geometry-stub.
- Watchman_route_problem wikiPageUsesTemplate Template:Reflist.
- Watchman_route_problem subject Category:Geometric_algorithms.
- Watchman_route_problem hypernym Problem.
- Watchman_route_problem type Disease.
- Watchman_route_problem type Algorithm.
- Watchman_route_problem comment "The Watchman Problem is an optimization problem in computational geometry where the objective is to compute the shortest route a watchman should take to guard an entire area with obstacles given only a map of the area. The challenge is to make sure the watchman peeks behind every corner and to determine the best order in which corners should be visited in. The problem may be solved in polynomial time when the area to be guarded is a simple polygon.".
- Watchman_route_problem label "Watchman route problem".
- Watchman_route_problem sameAs Q7973176.
- Watchman_route_problem sameAs m.08jlp3.
- Watchman_route_problem sameAs Q7973176.
- Watchman_route_problem wasDerivedFrom Watchman_route_problem?oldid=622025012.
- Watchman_route_problem isPrimaryTopicOf Watchman_route_problem.