Shipper collaboration

Eiselt, 1995, Arc routing problems, part 1: the Chinese postman problem, Operations Research, 43, 231, 10.1287/opre.43.2.231

Thomassen, 1997, On the complexity of finding a minimum cycle cover of a graph, SIAM Journal on Computing, 26, 675, 10.1137/S0097539794267255

Kesel’man, 1987, Covering the edges of a graph by circuits, Kibernetica, 3, 16

Itai, 1981, Covering graphs by simple circuits, SIAM Journal on Computing, 10, 746, 10.1137/0210058

Bermond, 1983, Shortest covering of graphs with cycles, Journal of Combinatorial Theory, Series B, 35, 297, 10.1016/0095-8956(83)90056-4

Alon, 1985, Covering multigraphs by simple circuits, SIAM Journal on Algorithmic and Discrete Methods, 6, 345, 10.1137/0606035

Fraisse, 1985, Cycle covering in bridgeless graphs, Journal of Combinatorial Theory, Series B, 39, 146, 10.1016/0095-8956(85)90044-9

Jackson, 1990, Shortest circuit covers and postman tours in graphs with a nowhere zero 4-flows, SIAM Journal on Computing, 19, 659, 10.1137/0219044

Fan, 1992, Covering graphs by cycles, SIAM Journal on Discrete Mathematics, 5, 491, 10.1137/0405039

Labbe, 1998, Covering a graph with cycles, Computers and Operations Research, 25, 499, 10.1016/S0305-0548(97)00082-8