Randomized algorithms
The hardness of approximate optima in lattices, codes, and systems of linear equations
Journal of Computer and System Sciences - Special issue: papers from the 32nd and 34th annual symposia on foundations of computer science, Oct. 2–4, 1991 and Nov. 3–5, 1993
Some optimal inapproximability results
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
On the minimum label spanning tree problem
Information Processing Letters
Efficient approximation of product distributions
Random Structures & Algorithms
Design networks with bounded pairwise distance
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Zero knowledge and the chromatic number
Journal of Computer and System Sciences - Eleventh annual conference on structure and complexity 1996
On the red-blue set cover problem
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Constraint Satisfaction: The Approximability of Minimization Problems
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Planar 3-colorability is polynomial complete
ACM SIGACT News
Efficient algorithms for wavelength rerouting in WDM multi-fiber unidirectional ring networks
Computer Communications
Discrete Applied Mathematics
Red-blue covering problems and the consecutive ones property
Journal of Discrete Algorithms
An improved algorithm for the red-blue hitting set problem with the consecutive ones property
Information Processing Letters
Wavelength rerouting in survivable WDM networks
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
| Hi-index | 0.00 |
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.