Parameterized complexity of the \(k\)-arc Chinese postman problem
From MaRDI portal
Publication:340562
DOI10.1016/j.jcss.2016.07.006zbMath1353.68132MaRDI QIDQ340562
Publication date: 14 November 2016
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2016.07.006
90C35: Programming involving graphs or networks
68Q25: Analysis of algorithms and problem complexity
90C27: Combinatorial optimization