The two-center problem of uncertain points on a real line

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

Journal of Combinatorial Optimization, 2023, vol. 45, issue 2, No 14, 22 pages

Abstract: Abstract Facility location problems on uncertain demand data have attracted significant attention recently. In this paper, we consider the two-center problem on uncertain points on a real line. The input is a set $$\mathcal {P}$$ P of n uncertain points on the line. Each uncertain point is represented by a probability density function that is a piecewise uniform distribution (i.e., a histogram) of complexity m. The goal is to find two points (centers) on the line so that the maximum expected distance of all uncertain points to their expected closest centers is minimized. A previous algorithm for the uncertain k-center problem can solve this problem in $$O(mn\log mn + n\log ^2n)$$ O ( m n log m n + n log 2 n ) time. In this paper, we propose a more efficient algorithm solving it in $$O(mn\log m+n\log n)$$ O ( m n log m + n log n ) time. Besides, we give an algorithm of the same time complexity for the discrete case where each uncertain point follows a discrete distribution.

Keywords: Algorithms; Facility locations; Two-center; Uncertain points; Histogram (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-023-00996-w 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:45:y:2023:i:2:d:10.1007_s10878-023-00996-w

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

DOI: 10.1007/s10878-023-00996-w

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