Pages that link to "Item:Q4601942"
From MaRDI portal
The following pages link to Slowing down sorting networks to obtain faster sorting algorithms (Q4601942):
Displayed 50 items.
- An approximation algorithm for least median of squares regression (Q290249) (← links)
- Matroid and knapsack center problems (Q300451) (← links)
- Algorithms on minimizing the maximum sensor movement for barrier coverage of a linear domain (Q368758) (← links)
- Backup 2-center on interval graphs (Q442280) (← links)
- Shortest path problems on a polyhedral surface (Q472466) (← links)
- One-dimensional \(k\)-center on uncertain data (Q497686) (← links)
- Efficient algorithms for the one-dimensional \(k\)-center problem (Q500977) (← links)
- Computing the center of uncertain points on tree networks (Q527423) (← links)
- Parametric search made practical (Q598230) (← links)
- Fréchet distance with speed limits (Q621928) (← links)
- Link distance and shortest path problems in the plane (Q634253) (← links)
- Exact algorithms for the bottleneck Steiner tree problem (Q652535) (← links)
- Geometric pattern matching under Euclidean motion (Q676592) (← links)
- A generalized approximation framework for fractional network flow and packing problems (Q684147) (← links)
- Diameter, width, closest line pair, and parametric searching (Q685180) (← links)
- Approximate parametric searching (Q685496) (← links)
- Optimal slope selection via expanders (Q689630) (← links)
- Strongly polynomial-time approximation for a class of bicriteria problems. (Q703276) (← links)
- Improved complexity results for several multifacility location problems on trees (Q763099) (← links)
- Improved algorithms for the bichromatic two-center problem for pairs of points (Q824325) (← links)
- Reverse shortest path problem for unit-disk graphs (Q832915) (← links)
- Can we compute the similarity between surfaces? (Q848860) (← links)
- Selecting distances in arrangements of hyperplanes spanned by points. (Q878011) (← links)
- Computing the Fréchet distance between piecewise smooth curves (Q883235) (← links)
- Space-efficient algorithm for computing a centerpoint of a set of points in \(\mathbb{R}^2\) (Q906384) (← links)
- Parallel selection (Q913517) (← links)
- Partitioning arrangements of lines. I: An efficient deterministic algorithm (Q914373) (← links)
- Construction of \(\epsilon\)-nets (Q914376) (← links)
- An inverse model for the most uniform problem (Q924880) (← links)
- Computing the Fréchet distance between simple polygons (Q934016) (← links)
- Improved algorithms for the continuous tree edge-partition problems and a note on ratio and sorted matrices searches (Q972328) (← links)
- Center location problems on tree graphs with subtree-shaped customers (Q1005232) (← links)
- Computing and minimizing the relative regret in combinatorial optimization with interval data (Q1019293) (← links)
- Dynamic ham-sandwich cuts in the plane (Q1025301) (← links)
- Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time (Q1037652) (← links)
- New pseudopolynomial complexity bounds for the bounded and other integer knapsack related problems (Q1038094) (← links)
- Optimal movement of mobile sensors for barrier coverage of a planar region (Q1040594) (← links)
- Partitioning point sets in arbitrary dimension (Q1088420) (← links)
- L-infinity interdistance selection by parametric search (Q1115620) (← links)
- Finding effective ``Force targets'' for two-dimensional, multifinger frictional grips (Q1188112) (← links)
- Efficient parallel algorithms for r-dominating set and p-center problems on trees (Q1262780) (← links)
- Locating service centers with precedence constraints (Q1314338) (← links)
- Iterated nearest neighbors and finding minimal polytopes (Q1327455) (← links)
- Computing the smallest \(k\)-enclosing circle and related problems (Q1328752) (← links)
- Extremal polygon containment problems (Q1330463) (← links)
- Finding a minimum-weight \(k\)-link path in graphs with the concave Monge property and applications (Q1338956) (← links)
- Computing a centerpoint of a finite planar set of points in linear time (Q1338958) (← links)
- Linear-time algorithms for parametric minimum spanning tree problems on planar graphs (Q1391297) (← links)
- Improved algorithms for several network location problems with equality measures. (Q1408453) (← links)
- The complexity of hyperplane depth in the plane (Q1423588) (← links)