An FPTAS for generalized absolute 1-center problem in vertex-weighted graphs

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, 2017, vol. 34, issue 4, No 6, 1084-1095

Abstract: Abstract Given a vertex-weighted undirected connected graph $$G = (V, E, \ell , \rho )$$ G = ( V , E , ℓ , ρ ) , where each edge $$e \in E$$ e ∈ E has a length $$\ell (e) > 0$$ ℓ ( e ) > 0 and each vertex $$v \in V$$ v ∈ V has a weight $$\rho (v) > 0$$ ρ ( v ) > 0 , a subset $$T \subseteq V$$ T ⊆ V of vertices and a set S containing all the points on edges in a subset $$E' \subseteq E$$ E ′ ⊆ E of edges, the generalized absolute 1-center problem (GA1CP), an extension of the classic vertex-weighted absolute 1-center problem (A1CP), asks to find a point from S such that the longest weighted shortest path distance in G from it to T is minimized. This paper presents a simple FPTAS for GA1CP by traversing the edges in $$E'$$ E ′ using a positive real number as step size. The FPTAS takes $$O( |E| |V| + |V|^2 \log \log |V| + \frac{1}{\epsilon } |E'| |T| {\mathcal {R}})$$ O ( | E | | V | + | V | 2 log log | V | + 1 ϵ | E ′ | | T | R ) time, where $${\mathcal {R}}$$ R is an input parameter size of the problem instance, for any given $$\epsilon > 0$$ ϵ > 0 . For instances with a small input parameter size $${\mathcal {R}}$$ R , applying the FPTAS with $$\epsilon = \Theta (1)$$ ϵ = Θ ( 1 ) to the classic vertex-weighted A1CP can produce a $$(1 + \Theta (1))$$ ( 1 + Θ ( 1 ) ) -approximation in at most O(|E| |V|) time when the distance matrix is known and $$O(|E| |V| + |V|^2 \log \log |V|)$$ O ( | E | | V | + | V | 2 log log | V | ) time when the distance matrix is unknown, which are smaller than Kariv and Hakimi’s $$O(|E| |V| \log |V|)$$ O ( | E | | V | log | V | ) -time algorithm and $$O(|E| |V| \log |V| + |V|^3)$$ O ( | E | | V | log | V | + | V | 3 ) -time algorithm, respectively.

Keywords: Vertex-weighted graph; Generalized absolute 1-center; FPTAS (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-017-0130-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:jcomop:v:34:y:2017:i:4:d:10.1007_s10878-017-0130-4

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

DOI: 10.1007/s10878-017-0130-4

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 ().