Improving Street Based Routing Using Building Block Mutations
Proceedings of the Applications of Evolutionary Computing on EvoWorkshops 2002: EvoCOP, EvoIASP, EvoSTIM/EvoPLAN
Solving a Real World Routing Problem Using Multiple Evolutionary Agents
PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
Approximate mechanisms for the graphical TSP and other graph traversal problems
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Congestion avoiding mechanism based on inter-domain hierarchy
NETWORKING'08 Proceedings of the 7th international IFIP-TC6 networking conference on AdHoc and sensor networks, wireless networks, next generation internet
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
| Hi-index | 0.00 |
The mixed postman problem, a generalization of the Chinese postman problem, is that of finding the shortest tour that traverses each edge of a given mixed graph (a graph containing both undirected and directed edges) at least once. The problem is solvable in polynomial time either if the graph is undirected or if the graph is directed, but it is NP-hard in mixed graphs. An approximation algorithm with a performance ratio of 3/2 for the postman problem on mixed graphs is presented.