The Bounded Cycle-Cover Problem

References

• Alspach B., Goddyn L., Zhang C-Q. Graphs with the circuit cover property. Transactions of the American Mathematical Society (1994) 344:131–153Crossref, Google Scholar
• Balakrishnan A., Altinkemer K. Using a hop-constrained model to generate alternative communication network designs. ORSA J. Computing (1992) 4:192–205Link, Google Scholar
• Chickering D.M., Geiger D.Heckerman. On finding a cycle basis with a shortest maximal cycle. Information Processing Letters (1995) 54:55–58Crossref, Google Scholar
• Cosares S., Deutsch D.N., Saniee I., Wasem O.J. SONET Toolkit: a decision support system for the designing robust and cost-effective fiber optic networks. Interfaces (1995) 25:20–40Link, Google Scholar
• Cosares S., Saniee I. An optimization problem related to balancing loads on SONET rings. Telecommunication Systems (1994) 3:165–181Crossref, Google Scholar
• Dell'Amico M., Labbé M., Maffioli F. Exact solution of the SONET ring loading problem. Operation Research Letters (1999) 25:119–129Crossref, Google Scholar
• Edmonds J., Johnson E.L. Matching, Euler tours and the Chinese postman. Mathematical Programming (1973) 5:88–124Crossref, Google Scholar
• Fleischner H. Eulersche Linien und Kreisüberdeckungen, die vorgegebene Durchgänge in den Kanten vermeiden. J. Combinatorial Theory (1980) 29:145–167Crossref, Google Scholar
• Fredman M.L., Tarjan R.E. Fibonacci heaps and their uses in improved network optimization algorithms. J. of ACM (1987) 34:596–615Crossref, Google Scholar
• Garey M., Johnson D.Computers and Intractability: A Guide to the Theory of NP-Completeness (1979) (W.H. Freeman, San Francisco, CA) Google Scholar
• Guan M., Fleischner H. On the minimum weighted cycle-covering problem for planar graphs. Ars Combinatorica (1985) 20:61–68Google Scholar
• Horton J. A polynomial-time algorithm to find the shortest cycle basis of a graph. SIAM J. Computing (1987) 16:358–366Crossref, Google Scholar
• Itai A., Lipton R.J., Papadimitriou C.H., Rodeh M. Covering graphics by simple circuits. SIAM J. Computing (1981) 10:746–750Crossref, Google Scholar
• Itai A., Rodeh M. Covering a graph by circuits. Automata, Languages and programming (1978) 16(Springer-Verlag, Berlin, Germany) 289–299Lecture Notes in Computer Science no. 62Crossref, Google Scholar
• Itai A., Lipton R. J., Papadimitriou C. H., Rodeh M. Covering graphs by simple circuits. SIAM Computing (1981) 10:746–750Crossref, Google Scholar
• Kennington J. L., Nair V. S. S., Rahman M.H. Optimization based algorithms for finding minimal cost ring covers in survivable networks. Computational Optimization and Applications (1999) 14:219–230Crossref, Google Scholar
• Kennington J.L., Rahman M.H.The modular SONET network ring cover problem: algorithms and an empirical analysis (1998) (Department of Computer Science and Engineering, Southern Methodist University, Dallas TX 75226) . Technical Report 98-CSE-10Google Scholar
• Laguna M. Clustering for the design of SONET rings in interoffice telecommunications. Management Science (1994) 40:1533–1541Link, Google Scholar
• Shyur C-C., Wu Y-M., Chen C-H. The capacity comparison and cost analyses for SONET self-healing ring networks. IEICE Transactions on Communications E77-B (1994) 218–225Google Scholar
• Slevinsky J.B., Grover W.D., MacGregor M.H. An algorithm for survivable network design employing multiple self-healing rings. GLOBECOM '93 (1993) (IEEE Press, New York) Crossref, Google Scholar
• Thomassen C. On the complexity of finding a minimum cycle covers graph. SIAM Computing (1997) 26:675–677Crossref, Google Scholar
• Wu T-H.Fiber Network Service Survivability (1992) (Artech House, Inc., Norwood, MA) Google Scholar
• Zhang C-Q.Integer Flows and Cycle Covers of Graphs (1997) (Marcel Dekker, New York) Google Scholar