Approximation algorithms for np-hard routing problems.

Authors:
Greg Norman Frederickson
Affiliations:
-
Venue:
Approximation algorithms for np-hard routing problems.
Year:
1977

Citing 0
Cited 2

From few components to an eulerian graph by adding arcs

WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
A new view on Rural Postman based on Eulerian Extension and Matching

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract