The Via Minimization Problem is NP-Complete

Nicholas J. Naclerio, Sumio Masuda, Kazuo Nakajima. The Via Minimization Problem is NP-Complete. IEEE Transactions on Computers, 38(11):1604-1608, 1989.

Abstract

Abstract is missing.