The k-center problem of uncertain points on graphs
- 7 January 2026
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 193
Abstract
No abstract availableAll Related Versions
Funding Information
- National Science Foundation
This publication has 15 references indexed in Scilit:
- Computing k-centers of uncertain points on a real lineOperations Research Letters, 2022
- Improvements on approximation algorithms for clustering probabilistic dataKnowledge and Information Systems, 2021
- Covering Uncertain Points in a TreeAlgorithmica, 2019
- A note on computing the center of uncertain data on the real lineOperations Research Letters, 2016
- One-dimensional k-center on uncertain dataTheoretical Computer Science, 2015
- Efficient algorithms for the one-dimensional k-center problemTheoretical Computer Science, 2015
- Improved algorithms to network p -center location problemsComputational Geometry, 2014
- A note on searching line arrangements and applicationsInformation Processing Letters, 2013
- Efficient algorithms for center problems in cactus networksTheoretical Computer Science, 2007
- On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed DimensionJournal of Algorithms, 1996