Constant-factor approximations for Capacitated Arc Routing without triangle inequality

Research output: Contribution to journal › Article › peer-review

Original language	English
Pages (from-to)	290-292
Number of pages	3
Journal	Operations Research Letters
Volume	42
Issue number	4
DOIs	https://doi.org/10.1016/j.orl.2014.05.002
Publication status	Published - 1 Jan 2014
Externally published	Yes

Chinese postman, NP-hard problem, Polynomial-time approximation, Rural postman, Vehicle routing

ID: 22340632