Piotr Berman, Junichiro Fukuyama. An Online Algorithm for the Postman Problem with a Small Penalty. In Michel X. Goemans, Klaus Jansen, José D. P. Rolim, Luca Trevisan, editors, Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques, 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomization and Approxi. Volume 2129 of Lecture Notes in Computer Science, pages 48-54, Springer, 2001. [doi]
@inproceedings{BermanF01,
title = {An Online Algorithm for the Postman Problem with a Small Penalty},
author = {Piotr Berman and Junichiro Fukuyama},
year = {2001},
url = {http://link.springer.de/link/service/series/0558/bibs/2129/21290048.htm},
researchr = {https://researchr.org/publication/BermanF01},
cites = {0},
citedby = {0},
pages = {48-54},
booktitle = {Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques, 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomization and Approxi},
editor = {Michel X. Goemans and Klaus Jansen and José D. P. Rolim and Luca Trevisan},
volume = {2129},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-42470-9},
}