A note on computing the center of uncertain data on the real line
Authors:
- Haitao WangHWHaitao Wang
- Jingru ZhangJZJingru Zhang
- 1 May 2016
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 44 (3) , 370-373
Abstract
No abstract availableFunding Information
- National Science Foundation (CCF-1317143)
This publication has 17 references indexed in Scilit:
- Efficient algorithms for the one-dimensional k-center problemTheoretical Computer Science, 2015
- Indexing uncertain data2009
- Cleaning uncertain data with quality guaranteesProceedings of the VLDB Endowment, 2008
- Approximation algorithms for clustering uncertain data2008
- A 1-center problem on the plane with uniformly distributed demand pointsOperations Research Letters, 2006
- Parametric search and locating supply centers in trees2005
- Facility location problems with uncertainty on the planeDiscrete Optimization, 2005
- Minimax regret p-center location on a network with demand uncertaintyLocation Science, 1997
- Slowing down sorting networks to obtain faster sorting algorithmsJournal of the ACM, 1987
- Polynomially bounded algorithms for locatingp-centers on a treeMathematical Programming, 1982