Generalized loop-back recovery in optical mesh networks
IEEE/ACM Transactions on Networking (TON)
Framework of spare capacity re-allocation with S-SLSP for mesh WDM networks
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Towards a new internet architecture
Reconfiguration of spare capacity for MPLS-based recovery in the internet backbone networks
IEEE/ACM Transactions on Networking (TON)
Group shared protection for spare capacity reconfiguration in optical networks
Computer Networks: The International Journal of Computer and Telecommunications Networking - Optical networks
The Profitable Arc Tour Problem: Solution with a Branch-and-Price Algorithm
Transportation Science
Simple pre-provisioning scheme to enable fast restoration
IEEE/ACM Transactions on Networking (TON)
Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width
Discrete Applied Mathematics
Group shared protection for spare capacity reconfiguration in optical networks
Computer Networks: The International Journal of Computer and Telecommunications Networking - Optical networks
From digital plane segmentation to polyhedral representation
Proceedings of the 11th international conference on Theoretical foundations of computer vision
M2-CYCLE: An optical layer algorithm for fast link failure detection in all-optical mesh networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Note: Parameterized complexity of k-Chinese Postman Problem
Theoretical Computer Science
Hi-index | 0.00 |
We prove that the problem of finding a cycle cover of smallest total length is NP-hard. This confirms a conjecture of Itai, Lipton, Papadimitriou, and Rodeh from 1981.