Approximating the asymmetric p-center problem in parameterized complete digraphs

Wei Ding () and Ke Qiu ()
Additional contact information
Wei Ding: Zhejiang University of Water Resources and Electric Power
Ke Qiu: Brock University

Journal of Combinatorial Optimization, 2020, vol. 40, issue 1, No 2, 35 pages

Abstract: Abstract The asymmetric p-center problem (ApCP) was proved by Chuzhoy et al. (STOC’04) to be NP-hard to approximate within a factor of $$\log ^*n - \Theta (1)$$log∗n-Θ(1) unless $$\mathrm {NP} \subseteq \mathrm {DTIME}(n^{\log \log n})$$NP⊆DTIME(nloglogn). This paper studies ApCP and the vertex-weighted asymmetric p-center problem (WApCP). First, we propose four classes of parameterized complete digraphs, $$\alpha $$α-CD, $$(\alpha , \beta )$$(α,β)-CD, $$\langle \alpha , \gamma \rangle $$⟨α,γ⟩-CD and $$(\alpha , \beta , \gamma )$$(α,β,γ)-CD, from the angle of the parameterized upper bound on the ratio of two asymmetric edge weights between vertices as well as on the ratio of two vertex weights, and the parameterized triangle inequality, respectively. Using the greedy approach, we achieve a $$(1 + \alpha )$$(1+α)- and $$\beta \cdot (1 + \alpha )$$β·(1+α)-approximation algorithm for the ApCP in $$\alpha $$α-CD’s and $$(\alpha , \beta )$$(α,β)-CD’s, respectively, as well as a $$(1 + \alpha \gamma )$$(1+αγ)- and $$\beta \cdot (1 + \alpha \gamma )$$β·(1+αγ)-approximation algorithm for the WApCP in $$\langle \alpha , \gamma \rangle $$⟨α,γ⟩-CD’s and $$(\alpha , \beta , \gamma )$$(α,β,γ)-CD’s, respectively.

Keywords: Asymmetric p-center; Parameterized; Greedy (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-020-00559-3 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:jcomop:v:40:y:2020:i:1:d:10.1007_s10878-020-00559-3

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-020-00559-3

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().