The Windy Postman Problem on Series-Parallel Graphs

Abstract : The windy postman problem is the NP-hard problem of finding the minimum cost of a tour traversing all edges of an undirected graph, where the cost of traversal of an edge depends on the direction. Given an undirected graph $G$, we consider the polyhedron $O(G)$ induced by the linear programming relaxation of a well-known integer programming formulation of the problem. We say that $G$ is windy postman perfect if $O(G)$ is integral. There exists a polynomial-time algorithm, based on the ellipsoid method, to solve the windy postman problem for the class of windy postman perfect graphs. Eulerian graphs and trees are windy postman perfect. By considering a family of polyhedra related to $O(G)$, we prove that series-parallel graphs are windy postman perfect, therefore solving a conjecture of [Win1987a].
Type de document :
Communication dans un congrès
Stefan Felsner. 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 2005, Berlin, Germany. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), pp.161-166, 2005, DMTCS Proceedings
Liste complète des métadonnées

Littérature citée [3 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01184352
Contributeur : Coordination Episciences Iam <>
Soumis le : vendredi 14 août 2015 - 11:36:55
Dernière modification le : jeudi 11 mai 2017 - 01:02:54
Document(s) archivé(s) le : dimanche 15 novembre 2015 - 10:58:24

Fichier

dmAE0132.pdf
Fichiers éditeurs autorisés sur une archive ouverte

Identifiants

  • HAL Id : hal-01184352, version 1

Collections

Citation

Francisco Javier Zaragoza Martínez. The Windy Postman Problem on Series-Parallel Graphs. Stefan Felsner. 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 2005, Berlin, Germany. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), pp.161-166, 2005, DMTCS Proceedings. 〈hal-01184352〉

Partager

Métriques

Consultations de la notice

32

Téléchargements de fichiers

72