An algorithm for min-cost edge-disjoint cycles and its applications
References (15)
Planar multicommodity flows, max cut and the chinese postman problem
- et al.
A graph theoretic via minimization algorithm for two layer printed circuit board
IEEE Trans. Circuits and Systems
(1983) - et al.
Matching, Euler tours and the chinese postman
Math. Programming
(1973) Graph Algorithms
(1979)- et al.
An O(EV log V) algorithm for finding a maximal weighted matching in general graphs
SIAM J. Comput.
(1986) - et al.
Shortest path algorithms using dynamic breadth-first search
Networks
(1991) The maximum weighted cycle-packing problem and its relation to the chinese postman problem
There are more references available in the full text version of this article.
Cited by (1)
Network service scheduling and routing
2004, International Transactions in Operational Research
- ∗
Supported in part by an NSF Presidential Young Investigator Award (grant DCR-8451397), with matching funds from AT & T.
Copyright © 1992 Published by Elsevier B.V.