Finding k points with minimum diameter and related problems
From MaRDI portal
(Redirected from Publication:3201788)
Recommendations
Cited in
(63)- Region-restricted clustering for geographic data mining
- Algorithms for optimal outlier removal
- Smallest \(k\)-point enclosing rectangle and square of arbitrary orientation
- Finding minimum area \(k\)-gons
- Finding the \(k\) smallest spanning trees
- Iterated nearest neighbors and finding minimal polytopes
- Computing the smallest k-enclosing circle and related problems
- Cluster analysis and mathematical programming
- Compact location problems
- Computing a minimum-width square or rectangular annulus with outliers
- Covering points with convex sets of minimum size
- On geometric optimization with few violated constraints
- Largest and smallest area triangles on imprecise points
- Smallest \(k\)-enclosing rectangle revisited
- Approximation and complexity of the capacitated geometric median problem
- Linear-size universal discretization of geometric center-based problems in fixed dimensions
- Selecting a subset of diverse points based on the squared Euclidean distance
- Complexity of some problems of quadratic partitioning of a finite set of points in Euclidean space into balanced clusters
- Exact algorithms for two integer-valued problems of searching for the largest subset and longest subsequence
- NP-completeness of some problems of partitioning a finite set of points in Euclidean space into balanced clusters
- Finding axis-parallel rectangles of fixed perimeter or area containing the largest number of points
- Randomized algorithms for some hard-to-solve problems of clustering a finite set of points in Euclidean space
- Complexity and approximation of the smallest \(k\)-enclosing ball problem
- Approximation and inapproximability results for maximum clique of disc graphs in high dimensions
- Approximation scheme for the problem of weighted 2-clustering with a fixed center of one cluster
- On finding a large number of 3D points with a small diameter
- An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
- Maximizing single attribute diversity in group selection
- Quantile approximation for robust statistical estimation and \(k\)-enclosing problems
- Minimum area polygons with two reflex angles enclosingkPoints
- Placing two axis-parallel squares to maximize the number of enclosed points
- Covering Points with Convex Sets of Minimum Size
- Computing a Minimum-Width Square or Rectangular Annulus with Outliers
- Enclosing k points in the smallest axis parallel rectangle
- Solving some vector subset problems by Voronoi diagrams
- scientific article; zbMATH DE number 437530 (Why is no real title available?)
- Computational complexity and approximation for a generalization of the Euclidean problem on the Chebyshev center
- Computing optimal islands
- Differential approximation of NP-hard problems with equal size feasible solutions
- Computing the Smallest T-Shaped Polygon Containing k Points
- Static and Dynamic Algorithms for k-Point Clustering Problems
- Easy NP-hardness Proofs of Some Subset Choice Problems
- Some Estimates on the Discretization of Geometric Center-Based Problems in High Dimensions
- Finding the k smallest spanning trees
- Static and dynamic algorithms for k-point clustering problems
- Smallest k-enclosing rectangle revisited
- Computational complexity of the problem of choosing typical representatives in a 2-clustering of a finite set of points in a metric space
- scientific article; zbMATH DE number 7205030 (Why is no real title available?)
- Polynomial-Time Approximation Scheme for a Problem of Searching for the Largest Subset with the Constraint on Quadratic Variation
- The problem of a minimal ball enclosing k points
- Square and Rectangle Covering with Outliers
- Compact location problems with budget and communication constraints
- Complexity and approximability of certain bicriteria location problems
- Covering points by disjoint boxes with outliers
- Approximating the smallest \(k\)-enclosing geodesic disc in a simple polygon
- A novel approximation algorithm for max-covering circle problem
- On enclosing k points by a circle
- An O\((\log k)\)-approximation algorithm for the \(k\) minimum spanning tree problem in the plane
- Computational complexity of the choice problem for typical representatives of a finite point set in a metric space
- On k-enclosing slab problems
- Title not available (Why is no real title available?)
- Title not available (Why is no real title available?)
- Cause I'm a genial imprecise point: outlier detection for uncertain data
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)
