Approximation algorithms for the arc orienteering problem

Damianos Gavalas,Charalampos Konstantopoulos,Konstantinos Mastakas,Grammati Pantziou,Nikolaos Vathis

doi:10.1016/j.ipl.2014.10.003

Approximation algorithms for the arc orienteering problem

Damianos Gavalas, Charalampos Konstantopoulos + Show 3 more

https://doi.org/10.1016/j.ipl.2014.10.003

Copy DOI

Journal: Information Processing Letters	Publication Date: Oct 16, 2014
Citations: 28

Affiliation: National Technical University of Athens, Research Academic Computer Technology Institute, Technological Educational Institute of Athens, University of Piraeus, University of the Aegean

#Undirected Graphs #Approximation Algorithms + Show 5 more

Abstract
Full-Text PDF
Similar Papers

Abstract

In this article we present approximation algorithms for the Arc Orienteering Problem (AOP). We propose a polylogarithmic approximation algorithm in directed graphs, while in undirected graphs we give a (6+ϵ+o(1)) and a (4+ϵ)-approximation algorithm for arbitrary instances and instances of unit profit, respectively. Also, an inapproximability result for the AOP is obtained as well as approximation algorithms for the Mixed Orienteering Problem.

Full Text