Pages that link to "Item:Q3323282"

The following pages link to Generalized Selection and Ranking: Sorted Matrices (Q3323282):

Displaying 50 items.

• Efficiently approximating color-spanning balls (Q284593) (← links)
• Enclosing \(k\) points in the smallest axis parallel rectangle (Q293194) (← links)
• Labeling a rectilinear map more efficiently (Q294599) (← links)
• Fitting a step function to a point set (Q547281) (← links)
• Optimal parallel selection in sorted matrices (Q671400) (← links)
• Selection in \(X+Y\) and matrices with sorted rows and columns (Q761793) (← links)
• Improved algorithms for the bichromatic two-center problem for pairs of points (Q824325) (← links)
• Approximation algorithms for orthogonal line centers (Q831691) (← links)
• Ranking \(k\) maximum sums (Q884477) (← links)
• The complexity of searching in \(X+Y\) and other multisets (Q911276) (← links)
• Improved algorithms for the continuous tree edge-partition problems and a note on ratio and sorted matrices searches (Q972328) (← links)
• Cache-oblivious selection in sorted \(X+Y\) matrices (Q975535) (← links)
• Region-restricted clustering for geographic data mining (Q1000925) (← links)
• Optimal location with equitable loads (Q1026600) (← links)
• River routing in VLSI (Q1102106) (← links)
• Stacks, queues, and deques with order-statistic operations (Q1203596) (← links)
• On some geometric selection and optimization problems via sorted matrices (Q1265327) (← links)
• Geometric applications of posets (Q1276942) (← links)
• Fast algorithms for the maximum convolution problem (Q1332943) (← links)
• Optimal algorithms for generalized searching in sorted matrices (Q1389660) (← links)
• The centdian subtree on tree networks (Q1602695) (← links)
• Computing a minimum-width square or rectangular annulus with outliers (Q1624585) (← links)
• Optimizing squares covering a set of points (Q1749537) (← links)
• Facility location problems with uncertainty on the plane (Q1779686) (← links)
• Improved algorithms for placing undesirable facilities (Q1941958) (← links)
• Scheduling with gaps: new models and algorithms (Q2059088) (← links)
• Reverse shortest path problem in weighted unit-disk graphs (Q2154091) (← links)
• Linear-time fitting of a \(k\)-step function (Q2181242) (← links)
• Finding axis-parallel rectangles of fixed perimeter or area containing the largest number of points (Q2331206) (← links)
• Approximating points by a piecewise linear function (Q2375945) (← links)
• Weighted \(L_{\infty}\) isotonic regression (Q2409576) (← links)
• Near-linear approximation algorithms for geometric hitting sets (Q2429345) (← links)
• The Euclidean bottleneck Steiner path problem and other applications of \((\alpha ,\beta )\)-pair decomposition (Q2441579) (← links)
• A simple linear algorithm for computing rectilinear 3-centers (Q2486079) (← links)
• Matching sets of line segments (Q2662685) (← links)
• Obnoxious facility location: complete service with minimal harm (Q2708039) (← links)
• Linear-Time Fitting of a k-Step Function (Q2795937) (← links)
• A randomized algorithm for weighted approximation of points by a step function (Q2905273) (← links)
• Linear-Time Algorithms for Proportional Apportionment (Q2942662) (← links)
• THE ALIGNED K-CENTER PROBLEM (Q2999091) (← links)
• MINKOWSKI SUM SELECTION AND FINDING (Q3089093) (← links)
• COVERING A POINT SET BY TWO DISJOINT RECTANGLES (Q3089094) (← links)
• On r-Gatherings on the Line (Q3452549) (← links)
• Fitting a Step Function to a Point Set (Q3541106) (← links)
• CONSTRUCTING OPTIMAL HIGHWAYS (Q3620612) (← links)
• Light graphs with small routing cost (Q4537619) (← links)
• COMPUTING THE DISCRETE FRÉCHET DISTANCE WITH IMPRECISE INPUT (Q4650089) (← links)
• 3-PIERCING OF d-DIMENSIONAL BOXES AND HOMOTHETIC TRIANGLES (Q4949990) (← links)
• Constrained square-center problems (Q5054846) (← links)
• Selection in monotone matrices and computing k th nearest neighbors (Q5056162) (← links)