The two-center problem of uncertain points on cactus graphs

Haitao Xu () and Jingru Zhang ()
Additional contact information
Haitao Xu: Cleveland State University
Jingru Zhang: Cleveland State University

Journal of Combinatorial Optimization, 2025, vol. 49, issue 4, No 1, 17 pages

Abstract: Abstract We study the two-center problem on cactus graphs in facility locations, which aims to place two facilities on the graph network to serve customers in order to minimize the maximum transportation cost. In our problem, the location of each customer is uncertain and may appear at O(m) points on the network with probabilities. More specifically, given are a cactus graph G and a set $$\mathcal {P}$$ P of n (weighted) uncertain points where every uncertain point has O(m) possible locations on G each associated with a probability and is of a non-negative weight. The problem aims to compute two centers (points) on G so that the maximum (weighted) expected distance of the n uncertain points to their own expected closest center is minimized. No previous algorithms are known for this problem. In this paper, we present the first algorithm for this problem and it solves the problem in $$O(|G|+ m^{2}n^{2}\log mn)$$ O ( | G | + m 2 n 2 log m n ) time.

Keywords: Algorithms; Two-center; Cactus graph; Uncertain points (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-025-01292-5 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:49:y:2025:i:4:d:10.1007_s10878-025-01292-5

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

DOI: 10.1007/s10878-025-01292-5

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