Before revision:  Finally, we show that even if only two given paths are allowed for each commodity, the robust network design problem with minimum congestion or linear costs is hard to approximate within some constant k .
After revision:  Finally, we show that even if only two given paths are allowed for each commodity, the robust network design problem with minimum congestion or linear cost is hard to approximate within some constant k .