Pages that link to "Item:Q4601942"

The following pages link to Slowing down sorting networks to obtain faster sorting algorithms (Q4601942):

Displaying 50 items.

• The complexity of hyperplane depth in the plane (Q1423588) (← links)
• The centdian subtree on tree networks (Q1602695) (← links)
• Computing the similarity between moving curves (Q1615772) (← links)
• Revisiting \(k\)-sum optimization (Q1675256) (← links)
• The multi-service center problem (Q1680546) (← links)
• A note on computing the center of uncertain data on the real line (Q1790197) (← links)
• Output-sensitive results on convex hulls, extreme points, and related problems (Q1816463) (← links)
• Continuous bottleneck tree partitioning problems (Q1827846) (← links)
• Algorithmic results for ordered median problems (Q1866979) (← links)
• Efficient piecewise-linear function approximation using the uniform metric (Q1906048) (← links)
• Some variations on constrained minimum enclosing circle problem (Q1944391) (← links)
• On the planar two-center problem and circular hulls (Q2105328) (← links)
• Rearranging a sequence of points onto a line (Q2144451) (← links)
• An efficient algorithm for the proximity connected two center problem (Q2169955) (← links)
• Constant work-space algorithms for facility location problems (Q2192101) (← links)
• Efficient planar two-center algorithms (Q2230394) (← links)
• Parametric search: three new applications (Q2266831) (← links)
• Efficient algorithms for the sum selection problem and \(k\) maximum sums problem (Q2268857) (← links)
• Computing the center region and its variants (Q2272371) (← links)
• A selectable sloppy heap (Q2312418) (← links)
• A combinatorial algorithm for the ordered 1-median problem on cactus graphs (Q2329555) (← links)
• Computing a geodesic two-center of points in a simple polygon (Q2331214) (← links)
• Optimal point movement for covering circular regions (Q2354019) (← links)
• Selecting distances in the plane (Q2366232) (← links)
• Efficient algorithms for center problems in cactus networks (Q2371802) (← links)
• Approximating points by a piecewise linear function (Q2375945) (← links)
• On the planar piecewise quadratic 1-center problem (Q2379920) (← links)
• A note on searching line arrangements and applications (Q2444761) (← links)
• A generalized model of equality measures in network location problems (Q2456627) (← links)
• Intersection of unit-balls and diameter of a point set in \(\mathbb R^3\). (Q2482899) (← links)
• The constrained minimum weighted sum of job completion times problem (Q2494511) (← links)
• One-way and round-trip center location problems (Q2568335) (← links)
• Locating two obnoxious facilities using the weighted maximin criterion (Q2583716) (← links)
• Optimizing sorting algorithms by using sorting networks (Q2628305) (← links)
• The two-center problem of uncertain points on a real line (Q2687919) (← links)
• Linear-Time Fitting of a k-Step Function (Q2795937) (← links)
• Geometric p-Center Problems with Centers Constrained to Two Lines (Q2958084) (← links)
• The (1|1)-Centroid Problem in the Plane with Distance Constraints (Q3177899) (← links)
• Computing the Center of Uncertain Points on Tree Networks (Q3449857) (← links)
• New Upper Bounds on Continuous Tree Edge-Partition Problem (Q3511413) (← links)
• Distance-constrained multifacility minimax location problems on tree networks (Q3989543) (← links)
• ON ENUMERATING AND SELECTING DISTANCES (Q4682169) (← links)
• OPTIMAL FACILITY LOCATION UNDER VARIOUS DISTANCE FUNCTIONS (Q4762912) (← links)
• LABELING POINTS WITH RECTANGLES OF VARIOUS SHAPES (Q4818575) (← links)
• Using sparsification for parametric minimum spanning tree problems (Q5054811) (← links)
• Parametric problems on graphs of bounded tree-width (Q5056150) (← links)
• Optimal parametric search on graphs of bounded tree-width (Q5056174) (← links)
• Computing the smallest k-enclosing circle and related problems (Q5060125) (← links)
• Linear-time algorithms for parametric minimum spanning tree problems on planar graphs (Q5096337) (← links)
• (Q5111728) (← links)