Generalized Selection and Ranking: Sorted Matrices
From MaRDI portal
Recommendations
Cited in
(73)- Region-restricted clustering for geographic data mining
- Optimal location with equitable loads
- Storing matrices on disk for efficient row and column retrieval
- River routing in VLSI
- Stacks, queues, and deques with order-statistic operations
- On some geometric selection and optimization problems via sorted matrices
- Geometric applications of posets
- Fast algorithms for the maximum convolution problem
- On parallel selection and searching in partial orders: Sorted matrices
- Optimal algorithms for generalized searching in sorted matrices
- The centdian subtree on tree networks
- Computing a minimum-width square or rectangular annulus with outliers
- Optimizing squares covering a set of points
- Facility location problems with uncertainty on the plane
- Improved algorithms for placing undesirable facilities
- Scheduling with gaps: new models and algorithms
- Reverse shortest path problem in weighted unit-disk graphs
- Linear-time fitting of a \(k\)-step function
- Finding axis-parallel rectangles of fixed perimeter or area containing the largest number of points
- Approximating points by a piecewise linear function
- Weighted \(L_{\infty}\) isotonic regression
- Near-linear approximation algorithms for geometric hitting sets
- The Euclidean bottleneck Steiner path problem and other applications of ( , )-pair decomposition
- A simple linear algorithm for computing rectilinear 3-centers
- Matching sets of line segments
- Obnoxious facility location: complete service with minimal harm
- Linear-time fitting of a k-step function
- Efficiently approximating color-spanning balls
- A randomized algorithm for weighted approximation of points by a step function
- Enclosing k points in the smallest axis parallel rectangle
- Linear-time algorithms for proportional apportionment
- Labeling a rectilinear map more efficiently
- THE ALIGNED K-CENTER PROBLEM
- Minkowski sum selection and finding
- Covering a point set by two disjoint rectangles
- On parsimonious explanations for 2-D tree- and linearly-ordered data
- On r-gatherings on the line
- Fitting a Step Function to a Point Set
- CONSTRUCTING OPTIMAL HIGHWAYS
- Light graphs with small routing cost
- Computing the discrete Fréchet distance with imprecise input
- scientific article; zbMATH DE number 742987 (Why is no real title available?)
- 3-PIERCING OF d-DIMENSIONAL BOXES AND HOMOTHETIC TRIANGLES
- Constrained square-center problems
- Selection in monotone matrices and computing k th nearest neighbors
- On some geometric selection and optimization problems via sorted matrices
- Geometric applications of posets
- scientific article; zbMATH DE number 7205030 (Why is no real title available?)
- An \(O(n\log n)\)-time algorithm for the \(k\)-center problem in trees
- A simple algorithm for \(r\)-gatherings on the line
- Fitting a step function to a point set
- Jaywalking your dog: computing the Fréchet distance with shortcuts
- An O(n n)-time algorithm for the k-center problem in trees
- Faster distance-based representative skyline and k-center along Pareto front in the plane
- Computing fair and bottleneck matchings in geometric graphs
- Computing the maximum overlap of two convex polygons under translations
- Selection from heaps, row-sorted matrices, and X+Y using soft heaps
- Optimal parallel selection in sorted matrices
- Algorithms for covering barrier points by mobile sensors with line constraint
- A faster algorithm for the Fréchet distance in 1D for the imbalanced case
- Constrained two-line center problems
- A near-linear time exact algorithm for the L₁-Geodesic Fréchet distance between two curves on the boundary of a simple polygon
- A linear time algorithm for the maximum overlap of two convex polygons under translation
- Faster algorithms for reverse shortest path in unit-disk graphs and related geometric optimization problems: improving the shrink-and-bifurcate technique
- Fréchet distance in unweighted planar graphs
- Selection in \(X+Y\) and matrices with sorted rows and columns
- Improved algorithms for the bichromatic two-center problem for pairs of points
- Approximation algorithms for orthogonal line centers
- Ranking \(k\) maximum sums
- The complexity of searching in \(X+Y\) and other multisets
- Improved algorithms for the continuous tree edge-partition problems and a note on ratio and sorted matrices searches
- Cache-oblivious selection in sorted \(X+Y\) matrices
- An (n n) lower bound for computing the sum of even-ranked elements
This page was built for publication: Generalized Selection and Ranking: Sorted Matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3323282)
