One-dimensional \(k\)-center on uncertain data
type: Item
instance of: scholarly article
title: One-dimensional \(k\)-center on uncertain data
zbMATH Open document ID: 1330.90049
author: Haitao Wang
author: Jingru Zhang
published in: Theoretical Computer Science
publication date: 2015-09-25T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 6485295
zbMATH Keywords: facility locations
zbMATH Keywords: \(k\)-center
zbMATH Keywords: uncertain data
zbMATH Keywords: algorithms
zbMATH Keywords: data structures
zbMATH Keywords: computational geometry
MaRDI profile type: Publication
full work available at URL: j.tcs.2015.08.017
OpenAlex ID: W1628490320
cites work: Local Search Heuristics for k-Median and Facility Location Problems
cites work: Facility location problems with uncertainty on the plane
cites work: Approximate clustering via core-sets
cites work: The algebraic degree of geometric optimization problems
cites work: Optimal slope selection via cuttings
cites work: Polynomially bounded algorithms for locatingp-centers on a tree
cites work: Algebraic optimization: The Fermat-Weber location problem
cites work: Fractional cascading. I: A data structuring technique
cites work: Fractional cascading. II: Applications
cites work: A note on searching line arrangements and applications
cites work: Efficient Algorithms for the Weighted k-Center Problem on a Real Line
cites work: Slowing down sorting networks to obtain faster sorting algorithms
cites work: On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem
cites work: Q4037428
cites work: Efficient algorithms for interval graphs and circular-arc graphs
cites work: On coresets for k-means and k-median clustering
cites work: Closest Pair and the Post Office Problem for Stochastic Points
cites work: Stochastic minimum spanning trees in euclidean spaces
cites work: Optimal slope selection via expanders
cites work: Geometric complexity of some location problems
cites work: Applying Parallel Computation Algorithms in the Design of Serial Algorithms
cites work: Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
cites work: On the Complexity of Some Common Geometric Location Problems
cites work: New Results on the Complexity of p-Centre Problems
cites work: An $O(n\log ^2 n)$ Algorithm for the kth Longest Path in a Tree with Applications to Location Problems
cites work: Maximum independent set for intervals by divide and conquer with pruning
cites work: Parametric search made practical
cites work: Minmax regret 1-facility location on uncertain path networks
cites work: Improved algorithms for the minmax-regret 1-center and 1-median problems
DOI: 10.1016/J.TCS.2015.08.017
description: scientific article; zbMATH DE number 6485295