@inbook {17671,
	title = {Wavelength Rerouting in Optical Networks, or the Venetian Routing Problem},
	booktitle = {Approximation Algorithms for Combinatorial Optimization},
	series = {Lecture Notes in Computer Science},
	volume = {1913},
	year = {2000},
	month = {2000///},
	pages = {71 - 84},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	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 such paths. In this paper we prove the computational hardness oft his 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.},
	isbn = {978-3-540-67996-7},
	url = {http://dx.doi.org/10.1007/3-540-44436-X_9},
	author = {Caprara,Alberto and Italiano,Giuseppe and Mohan,G. and Panconesi,Alessandro and Srinivasan, Aravind},
	editor = {Jansen,Klaus and Khuller, Samir}
}
