Parameterized Complexity of the k-Arc Chinese Postman Problem

DOI10.1007/978-3-662-44777-2_44zbMath1425.68143arXiv1403.1512OpenAlexW2595520334MaRDI QIDQ2921440

No author found.

Publication date: 8 October 2014

Published in: Algorithms - ESA 2014 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1403.1512

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27)

Related Items (4)

Structural Parameterizations of the Mixed Chinese Postman Problem ⋮ Chinese postman problem on edge-colored multigraphs ⋮ Completing Partial Schedules for Open Shop with Unit Processing Times and Routing ⋮ The Mixed Chinese Postman Problem Parameterized by Pathwidth and Treedepth

This page was built for publication: Parameterized Complexity of the k-Arc Chinese Postman Problem