Approximation algorithms for some min–max postmen cover problems

Wei Yu (), Zhaohui Liu () and Xiaoguang Bao ()
Additional contact information
Wei Yu: East China University of Science and Technology
Zhaohui Liu: East China University of Science and Technology
Xiaoguang Bao: Shanghai Ocean University

Annals of Operations Research, 2021, vol. 300, issue 1, No 10, 267-287

Abstract: Abstract We investigate two min–max k-postmen cover problems. The first is the Min–Max Rural Postmen Cover Problem (RPC), in which we are given an undirected weighted graph and the objective is to find at most k closed walks, covering a required subset of edges, to minimize the weight of the maximum weight closed walk. The other is called the Min–Max Chinese Postmen Cover Problem, in which the goal is to find at most k closed walks, covering all the edges of an undirected weighted graph, to minimize the weight of the maximum weight closed walk. For both problems we propose the first constant-factor approximation algorithms with ratios 10 and 4, respectively. For the Metric RPC, a special case of the RPC with the edge weights obeying the triangle inequality, we obtain an improved 6-approximation algorithm by a matching-based approach. For the Min–Max Rural Postmen Walk Cover Problem (RPWC), a variant of the RPC with the closed walks replaced by (open) walks, we give a 5-approximation algorithm that improves on the previous 7-approximation algorithm. If k is fixed, we devise improved approximation algorithms for the Metric RPC and the RPWC with ratios $$4+\epsilon $$ 4 + ϵ and $$3+\epsilon $$ 3 + ϵ , respectively, where $$\epsilon >0$$ ϵ > 0 is an arbitrary small constant. The latter result improves on the existing $$(4+\epsilon )$$ ( 4 + ϵ ) -approximation algorithm. Moreover, we develop a $$(3+\epsilon )$$ ( 3 + ϵ ) -approximation algorithm for a special case of the RPC with fixed k, improving on the previous $$(4+\epsilon )$$ ( 4 + ϵ ) -approximation algorithm.

Keywords: Approximation algorithm; Traveling salesman problem; Rural postman problem; Chinese postman problem; Postmen cover (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10479-021-03933-4 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:300:y:2021:i:1:d:10.1007_s10479-021-03933-4

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-021-03933-4

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().