Search Results for ""

A lion and a man in a closed arena have equal maximum speeds. What tactics should the lion employ to be sure of his meal? This problem was stated by Rado in 1925 (Littlewood ...

A shortest path between two graph vertices (u,v) of a graph (Skiena 1990, p. 225). There may be more than one different shortest paths, all of the same length. Graph ...

Given a ship with a known constant direction and speed v, what course should be taken by a chase ship in pursuit (traveling at speed V) in order to intercept the other ship ...

Dijkstra's algorithm is an algorithm for finding a graph geodesic, i.e., the shortest path between two graph vertices in a graph. It functions by constructing a shortest-path ...

The problem of determining (or counting) the set of all solutions to a given problem.

Given n points, find the line segments with the shortest possible total length which connect the points. The segments need not necessarily be straight from one point to ...

Consider a horse rider who wishes to feed his horse at a field, gather water from a river, and then return to his tent, all in the smallest overall distance possible. The ...

In a rectangular room (a cuboid) with dimensions 30^'×12^'×12^', a spider is located in the middle of one 12^'×12^' wall one foot away from the ceiling. A fly is in the ...

The graph distance matrix, sometimes also called the all-pairs shortest path matrix, is the square matrix (d_(ij)) consisting of all graph distances from vertex v_i to vertex ...

Consider a set A_n={a_1,a_2,...,a_n} of n positive integer-denomination postage stamps sorted such that 1=a_1<a_2<...<a_n. Suppose they are to be used on an envelope with ...