Approximation algorithms for the Street sweeping problem

Author

Hernandez Sanchez, L.F. ; Chavez Lomeli, L.E. ; Zaragoza Martinez, F.J.

Author_Institution

Posgrado en Optimizacion, UAM Azcapotzalco, Mexico City, Mexico

fYear

2014

fDate

Sept. 29 2014-Oct. 3 2014

Firstpage

1

Lastpage

4

Abstract

The Street sweeping problem (SSP) is a variation of the Windy postman problem (WPP) in which we must construct two tours traversing every edge, and each edge must be traversed once in each direction: one on the first tour and the opposite in the second tour. The computational complexity of this problem remains open. We present a (3/2 α + 1)-approximation algorithm for the SSP using an α-approximation algorithm for the WPP. We also present exact algorithms for some classes of graphs.

Keywords

approximation theory; computational complexity; graph theory; vehicle routing; α-approximation algorithm; SSP; WPP; Windy postman problem; computational complexity; graph class; street sweeping problem; Algorithm design and analysis; Approximation algorithms; Approximation methods; Cities and towns; Polynomials; Routing; Vectors; approximation algorithms; street sweeping problem; windy postman problem;

fLanguage

English

Publisher

ieee

Conference_Titel

Electrical Engineering, Computing Science and Automatic Control (CCE), 2014 11th International Conference on

Conference_Location

Campeche

Print_ISBN

978-1-4799-6228-0

Type

conf

DOI

10.1109/ICEEE.2014.6978276

Filename

6978276