@article {17670,
	title = {Wavelength rerouting in optical networks, or the Venetian Routing problem},
	journal = {Journal of Algorithms},
	volume = {45},
	year = {2002},
	month = {2002/11//},
	pages = {93 - 125},
	abstract = {Wavelength rerouting has been suggested as a viable and cost-effective method to improve the blocking performance of wavelength-routed wavelength-division multiplexing (WDM) networks. This method leads to the following combinatorial optimization problem, dubbed Venetian Routing. Given a directed multigraph G along with two vertices s and t and a collection of pairwise arc-disjoint paths, we wish to find an st-path which arc-intersects the smallest possible number of the given paths. In this paper we prove the computational hardness of this problem even in various special cases, and present several approximation algorithms for its solution. In particular we show a non-trivial connection between Venetian Routing and Label Cover.},
	keywords = {Approximation algorithms, Label Cover, Optical networks, Shortest paths, Wavelength rerouting, Wavelength-division multiplexing},
	isbn = {0196-6774},
	doi = {10.1016/S0196-6774(02)00214-6},
	url = {http://www.sciencedirect.com/science/article/pii/S0196677402002146},
	author = {Caprara,Alberto and Italiano,Giuseppe F. and Mohan,G. and Panconesi,Alessandro and Srinivasan, Aravind}
}
