On the complexity of edge traversing
From MaRDI portal
Publication:4121714
DOI10.1145/321958.321974zbMath0351.90079OpenAlexW2092395565MaRDI QIDQ4121714
Publication date: 1976
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/321958.321974
Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Integer programming (90C10)
Related Items
Algorithms for the windy postman problem, Approximation algorithms for solving the constrained arc routing problem in mixed graphs, Solvable cases of the \(k\)-person Chinese postman problem, Structural Parameterizations of the Mixed Chinese Postman Problem, Algorithms for the Chinese postman problem on mixed networks, Rural postman parameterized by the number of components of required edges, Reconstructing strings from substrings (Extended abstract), Parameterized complexity of the \(k\)-arc Chinese postman problem, Routing problems: A bibliography, Postman problems on series-parallel mixed graphs, Modeling and solving the endpoint cutting problem, Arc routing problems: A review of the past, present, and future, Approximation Algorithms for a Mixed Postman Problem with Restrictions on the Arcs, Approximation algorithms for the min-max mixed rural postmen cover problem and its variants, Approximation algorithms for the min-max mixed rural postmen cover problem and its variants, New results on the windy postman problem, A Decade of Capacitated Arc Routing, Chinese postman problem on edge-colored multigraphs, A cutting plane algorithm for the windy postman problem, Solution of real-world postman problems, Traversability, reconfiguration, and reachability in the gadget framework, A comparison of two different formulations for arc routing problems on mixed graphs, Covering partially directed graphs with directed paths, The Chinese deliveryman problem, City streets parking enforcement inspection decisions: the Chinese postman's perspective, Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width, Domino sequencing: scheduling with state-based sequence-dependent setup times, The maximum benefit Chinese postman problem and the maximum benefit traveling salesman problem, Genetic algorithm for Chinese postman problems, The mixed postman problem, Minimal length test vectors for multiple-fault detection, The Mixed Chinese Postman Problem Parameterized by Pathwidth and Treedepth, Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees, A GRASP heuristic for the mixed Chinese postman problem, Colored homomorphisms of colored mixed graphs, On the windy postman problem, The arc partitioning problem, On the mixed Chinese postman problem, On negative cycles in mixed graphs
