APA (7th ed.) Citation

Ahr, D., & Reinelt, G. (2002). New heuristics and lower bounds for the min-max k-chinese postman problem. Algorithms.

Chicago Style (17th ed.) Citation

Ahr, Dino, and Gerhard Reinelt. "New Heuristics and Lower Bounds for the Min-max K-chinese Postman Problem." Algorithms 2002.

MLA (9th ed.) Citation

Ahr, Dino, and Gerhard Reinelt. "New Heuristics and Lower Bounds for the Min-max K-chinese Postman Problem." Algorithms, 2002.