Using results by McKee and Woodall on binary matroids, we prove that the set of postman sets has odd cardinality, generalizing a result by Toida on the cardinality of cycles in Eu...
Eulerian extension problems aim at making a given (directed) (multi-)graph Eulerian by adding a minimum-cost set of edges (arcs). These problems have natural applications in schedu...
Frederic Dorn, Hannes Moser, Rolf Niedermeier, Mat...
In this paper we present several heuristic algorithms and a cutting-plane algorithm for the Windy Rural Postman Problem. This problem contains a big number of important Arc Routin...
In this work we introduce for extended real valued functions, defined on a Banach space X, the concept of K directionally Lipschitzian behavior, where K is a bounded subset of X. F...
—Methods for software testing based on Finite State Machines (FSMs) have been researched since the early 60’s. Many of these methods are about generating a checking sequence fr...