Given a graph with arc costs, the Bottleneck Traveling Salesman Problem is to find a Hamiltonian circuit that minimizes the largest cost of any of its arcs. Lower bounds for the problem (bottleneck ...
Transactions of the American Mathematical Society, Vol. 238 (Apr., 1978), pp. 45-55 (11 pages) Any analytic symplectic diffeomorphism $\Phi$ of a symplectic manifold ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback