Sciweavers

2356 search results - page 1 / 472
» Characterizations of postman sets
Sort
View
76
Voted
DM
2008
115views more  DM 2008»
14 years 9 months ago
Characterizations of postman sets
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...
Néstor E. Aguilera, Valeria A. Leoni
WG
2010
Springer
14 years 8 months ago
Efficient Algorithms for Eulerian Extension
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...
EOR
2007
76views more  EOR 2007»
14 years 10 months ago
Lower bounds and heuristics for the Windy Rural Postman Problem
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...
Enrique Benavent, Alessandro Carrotta, Angel Corbe...
SIAMJO
2010
74views more  SIAMJO 2010»
14 years 4 months ago
Various Lipschitz-like Properties for Functions and Sets I: Directional Derivative and Tangential Characterizations
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...
Rafael Correa, Pedro Gajardo, Lionel Thibault
ISCIS
2009
Springer
15 years 4 months ago
Using a SAT solver to generate checking sequences
—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...
Guy-Vincent Jourdan, Hasan Ural, Hüsnü Y...