Approximation Algorithms for Some Postman Problems
- 1 July 1979
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 26 (3), 538-554
- https://doi.org/10.1145/322139.322150
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- On the complexity of edge traversingJournal of the ACM, 1976
- On general routing problemsNetworks, 1976
- On general routing problems: CommentsNetworks, 1976
- Fast Approximation Algorithms for the Knapsack and Sum of Subset ProblemsJournal of the ACM, 1975
- Approximate Algorithms for the 0/1 Knapsack ProblemJournal of the ACM, 1975
- Approximation algorithms for combinatorial problemsJournal of Computer and System Sciences, 1974
- A fundamental problem in vehicle routingNetworks, 1974
- Matching, Euler tours and the Chinese postmanMathematical Programming, 1973
- Flows in NetworksPublished by Walter de Gruyter GmbH ,1963
- Algorithm 97: Shortest pathCommunications of the ACM, 1962