Abstract
The four problems considered are: the Chinese postman problem, the co-postman problem, the odd cut problem, and the odd circuit problem. Relationships are developed between these problems using results from dual matroids and blocking clutters. Connections with Gomory’s group problem are shown. The notion of representations of these binary group problems on augmented graphs is developed along with a discussion of the class of augmented graphs having the same solution set. After some blocking and duality results, we give forbidden augmented minors for problems of one type (e.g., Chinese postman) to be also a second type of problem (e.g., odd cut). Some results are given on b-regular problems and are used in the forbidden augmented minor characterizations.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
