Intractable is the problem of finding two link-disjoint paths of minimal cost if the path cost is limited since it can be a special case of the partition problem. In optical networks, this limit can be introduced by the signal modulation reach. Even without this limit, the existing literature suggested the problem intractable because of the spectrum continuity and contiguity constraints, but we show that the problem can be solved exactly with the recently-proposed generic Dijkstra algorithm over a polynomially-bounded search space, thus proving the problem tractable.

翻译：由于路径成本受限时寻找两条链路不相交的最小成本路径可归约为分割问题的特例，该问题原本被认为是不可解的。在光网络中，此类限制可由信号调制距离引入。即使不存在该限制，现有文献也因频谱连续性与相邻性约束而认定该问题不可解，但本文证明，通过近期提出的通用迪杰斯特拉算法在多项式有界搜索空间内可以精确求解该问题，从而证明该问题是可解的。