Publication:5271449
From MaRDI portal
zbMath1377.90114MaRDI QIDQ5271449
Rolf Niedermeier, René van Bevern, Manuel Sorge, Mathias Weller
Publication date: 11 July 2017
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
Structural Parameterizations of the Mixed Chinese Postman Problem, An algorithm with parameterized complexity of constructing the optimal schedule for the routing open shop problem with unit execution times, Rural postman parameterized by the number of components of required edges, The hierarchical Chinese postman problem: the slightest disorder makes it hard, yet disconnectedness is manageable, Postman problems on series-parallel mixed graphs, Parameterized complexity of \(k\)-Chinese postman problem, Approximation algorithms for the min-max clustered \(k\)-traveling salesmen problems, On approximate data reduction for the Rural Postman Problem: Theory and experiments, Approximation algorithms for the min-max mixed rural postmen cover problem and its variants, Polynomial-time data reduction for weighted problems beyond additive goal functions, Approximation Algorithms for Mixed, Windy, and Capacitated Arc Routing Problems, Approximation algorithms for some min-max postmen cover problems, Chinese postman problem on edge-colored multigraphs, Completing Partial Schedules for Open Shop with Unit Processing Times and Routing, Constant-factor approximations for capacitated arc routing without triangle inequality, The Mixed Chinese Postman Problem Parameterized by Pathwidth and Treedepth
