On the windy postman problem on Eulerian graphs (Q1119487)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4099070
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the windy postman problem on Eulerian graphs |
scientific article; zbMATH DE number 4099070 |
Statements
On the windy postman problem on Eulerian graphs (English)
0 references
1989
0 references
Given an undirected connected weighted graph G, the windy postman problem is to find a minimum cost orientation closed walk in G containing each edge at least once. The author presents a polynomial algorithm for the problem with Eulerian graphs. An approximation algorithm is given for general graphs with solution at most twice the optimum.
0 references
undirected connected weighted graph
0 references
windy postman problem
0 references
minimum cost orientation closed walk
0 references
polynomial algorithm
0 references
Eulerian graphs
0 references
approximation algorithm
0 references
0.8936313390731812
0 references
0.8931760191917419
0 references
0.8541101217269897
0 references
0.8358684778213501
0 references
0.8317879438400269
0 references
