We prove a general lower bound on the size of switching-and-rectifier networks over any semiring of zero characteristic, including the (min,+) semiring. Using it, we show that the classical dynamic programming algorithm of Bellman, Ford and Moore for the shortest s-t path problem is optimal, if only Min and Sum operations are allowed.

Abstract One of the basic assumptions in hub covering problems is considering the covering radius as an exogenous parameter which cannot be controlled by the decision maker. Practically and in many real world cases with a negligible increase in costs, to increase the covering radii, it is possible to save the costs of establishing additional hub nodes. Change in problem parameters during the pl...

We present the results of an extensive computational study on dynamic algorithms for all pairs shortest path problems. We describe our implementations of the recent dynamic algorithms of King [18] and of Demetrescu and Italiano [7], and compare them to the dynamic algorithm of Ramalingam and Reps [25] and to static algorithms on random, real-world and hard instances. Our experimental data sugge...

With conventional dynamic routing algorithms, many query messages are required in a distributed environment for e cient multicast routing of any tra c volume. We have developed a dynamic routing algorithm that uses a predetermined path search in which an appropriate multicast path is dynamically constructed by searching only a few nodes. This algorithm can construct an e cient multicast tree fo...

An efficient path planning algorithm for general 6 degrees of freedom robots is presented in the paper. The path planner is based on multiheuristic A search algorithm with dynamic subgoal generation for rapid escaping from deep local-minimum wells. The algorithm has been implemented as an extension to a robot off-line programming and simulation system for testing. The presented test results dem...

An efficient path planning algorithm for general 6 degrees of freedom robots is presented in the paper. The path planner is based on multiheuristic A search algorithm with dynamic subgoal generation for rapid escaping from deep local-minimum wells. The algorithm has been implemented as an extension to a robot off-line programming and simulation system for testing. The presented test results dem...