A 3/2-Approximation Algorithm for the Mixed Postman Problem
From MaRDI portal
Publication:4699169
DOI10.1137/S0895480197331454zbMath0947.90096MaRDI QIDQ4699169
Balaji Raghavachari, Jeyakesavan Veerasamy
Publication date: 23 November 1999
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Inventory, storage, reservoirs (90B05) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45)
Related Items (8)
Approximation algorithms for solving the constrained arc routing problem in mixed graphs ⋮ On matchings, T‐joins, and arc routing in road networks ⋮ Approximation Algorithms for a Mixed Postman Problem with Restrictions on the Arcs ⋮ Approximation algorithms for the min-max mixed rural postmen cover problem and its variants ⋮ Approximation algorithms for the min-max mixed rural postmen cover problem and its variants ⋮ The single robot line coverage problem: Theory, algorithms, and experiments ⋮ Approximation Algorithms for Mixed, Windy, and Capacitated Arc Routing Problems ⋮ Recent results on Arc Routing Problems: An annotated bibliography
This page was built for publication: A 3/2-Approximation Algorithm for the Mixed Postman Problem
