Finding k points with minimum diameter and related problems
From MaRDI portal
DOI10.1016/0196-6774(91)90022-QzbMATH Open0715.68082OpenAlexW2046227217MaRDI QIDQ3201788FDOQ3201788
Subhash Suri, Hideki Imai, Alok Aggarwal, Naoki Katoh
Publication date: 1991
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0196-6774(91)90022-q
Recommendations
Pattern recognition, speech recognition (68T10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cited In (59)
- Quantile approximation for robust statistical estimation and \(k\)-enclosing problems
- An O\((\log k)\)-approximation algorithm for the \(k\) minimum spanning tree problem in the plane
- Cause I'm a genial imprecise point: outlier detection for uncertain data
- Computing the Smallest T-Shaped Polygon Containing k Points
- Smallest k-enclosing rectangle revisited
- Approximation and complexity of the capacitated geometric median problem
- Title not available (Why is that?)
- Minimum area polygons with two reflex angles enclosingkPoints
- Computing the smallest \(k\)-enclosing circle and related problems
- On finding a large number of 3D points with a small diameter
- Computing a minimum-width square or rectangular annulus with outliers
- Linear-size universal discretization of geometric center-based problems in fixed dimensions
- Complexity and approximation of the smallest \(k\)-enclosing ball problem
- Polynomial-Time Approximation Scheme for a Problem of Searching for the Largest Subset with the Constraint on Quadratic Variation
- Algorithms for optimal outlier removal
- Approximation and inapproximability results for maximum clique of disc graphs in high dimensions
- Static and dynamic algorithms for k-point clustering problems
- On enclosing k points by a circle
- Computing optimal islands
- Cluster analysis and mathematical programming
- Approximation scheme for the problem of weighted 2-clustering with a fixed center of one cluster
- Enclosing \(k\) points in the smallest axis parallel rectangle
- Region-restricted clustering for geographic data mining
- Smallest \(k\)-enclosing rectangle revisited
- Finding the k smallest spanning trees
- Placing two axis-parallel squares to maximize the number of enclosed points
- Finding axis-parallel rectangles of fixed perimeter or area containing the largest number of points
- Covering points with convex sets of minimum size
- Computing a Minimum-Width Square or Rectangular Annulus with Outliers
- Iterated nearest neighbors and finding minimal polytopes
- Selecting a subset of diverse points based on the squared Euclidean distance
- Smallest \(k\)-point enclosing rectangle and square of arbitrary orientation
- On geometric optimization with few violated constraints
- Some Estimates on the Discretization of Geometric Center-Based Problems in High Dimensions
- Finding the \(k\) smallest spanning trees
- An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
- Compact location problems
- Maximizing single attribute diversity in group selection
- Exact algorithms for two integer-valued problems of searching for the largest subset and longest subsequence
- Covering Points with Convex Sets of Minimum Size
- Solving some vector subset problems by Voronoi diagrams
- Static and Dynamic Algorithms for k-Point Clustering Problems
- Largest and smallest area triangles on imprecise points
- Finding minimum area \(k\)-gons
- NP-completeness of some problems of partitioning a finite set of points in Euclidean space into balanced clusters
- Randomized algorithms for some hard-to-solve problems of clustering a finite set of points in Euclidean space
- Title not available (Why is that?)
- Computational complexity and approximation for a generalization of the Euclidean problem on the Chebyshev center
- Covering points by disjoint boxes with outliers
- Differential approximation of NP-hard problems with equal size feasible solutions
- Complexity of some problems of quadratic partitioning of a finite set of points in Euclidean space into balanced clusters
- The problem of a minimal ball enclosing k points
- Easy NP-hardness Proofs of Some Subset Choice Problems
- Computational complexity of the problem of choosing typical representatives in a 2-clustering of a finite set of points in a metric space
- A novel approximation algorithm for max-covering circle problem
- Approximating the smallest \(k\)-enclosing geodesic disc in a simple polygon
- Compact location problems with budget and communication constraints
- Square and Rectangle Covering with Outliers
- Complexity and approximability of certain bicriteria location problems
This page was built for publication: Finding k points with minimum diameter and related problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3201788)
