An algorithm and a core set result for the weighted Euclidean one-center problem
type: Item
instance of: scholarly article
zbMATH Open document ID: 1243.90098
author: Piyush Kumar
author: E. Alper Yildirim
published in: INFORMS Journal on Computing
publication date: 2012-07-28T00:00:00Z
full work available at URL: http://hdl.handle.net/11693/22646
Mathematics Subject Classification ID: 90B85
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6060450
zbMATH Keywords: weighted Euclidean one-center problem minimum enclosing balls core sets approximation algorithms
MaRDI profile type: Publication
OpenAlex ID: W2143181869
DOI: 10.1287/IJOC.1080.0315
Recommended article: The Weighted Euclidean 1-Center Problem
Recommended article: An O(nlogn) randomizing algorithm for the weighted euclidean 1-center problem
Recommended article: A linear time algorithm for the weighted lexicographic rectilinear 1-center problem in the plane
Recommended article: Exact Algorithm for the One-Dimensional Quadratic Euclidean Cardinality-Weighted 2-Clustering with Given Center Problem
Recommended article: Efficient Algorithms for the Weighted k-Center Problem on a Real Line
Recommended article: On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem
Recommended article: Optimal Algorithms for the Weighted p-Center Problems on the Real Line for Small p
Recommended article: Efficient algorithms for the one-dimensional \(k\)-center problem
Recommended article: Optimal Algorithms for Constrained 1-Center Problems
Recommended article: The (1|1)-Centroid Problem in the Plane with Distance Constraints
title: An algorithm and a core set result for the weighted Euclidean one-center problem
description: scientific article; zbMATH DE number 6060450