Skip to main content
Book Chapter

Arc Routing: Complexity and Approximability

  • Dror M
Springer US, (2000), 133-169
DOI: 10.1007/978-1-4615-4495-1_4
N/ACitations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Cite

CITATION STYLE

APA

Dror, M. (2000). Arc Routing: Complexity and Approximability. In Arc Routing (pp. 133–169). Springer US. https://doi.org/10.1007/978-1-4615-4495-1_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free