Pages that link to "Item:Q3763585"
From MaRDI portal
The following pages link to Applying Parallel Computation Algorithms in the Design of Serial Algorithms (Q3763585):
Displaying 50 items.
- Budget-constrained minimum cost flows (Q281825) (← links)
- An approximation algorithm for least median of squares regression (Q290249) (← links)
- The economic lot-sizing problem with an emission capacity constraint (Q299782) (← links)
- On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree (Q344954) (← links)
- Algorithms on minimizing the maximum sensor movement for barrier coverage of a linear domain (Q368758) (← links)
- Prune-and-search with limited workspace (Q473192) (← links)
- One-dimensional \(k\)-center on uncertain data (Q497686) (← links)
- Computing the geodesic center of a simple polygon (Q582099) (← links)
- Parametric search made practical (Q598230) (← links)
- Fréchet distance with speed limits (Q621928) (← links)
- Farthest-polygon Voronoi diagrams (Q632728) (← links)
- Exact algorithms for the bottleneck Steiner tree problem (Q652535) (← links)
- On enclosing k points by a circle (Q674185) (← links)
- Geometric pattern matching under Euclidean motion (Q676592) (← links)
- Approximating the minimum closest pair distance and nearest neighbor distances of linearly moving points (Q680145) (← links)
- A generalized approximation framework for fractional network flow and packing problems (Q684147) (← links)
- Diameter, width, closest line pair, and parametric searching (Q685180) (← links)
- On ray shooting in convex polytopes (Q685183) (← links)
- Approximate parametric searching (Q685496) (← links)
- Optimal slope selection via expanders (Q689630) (← links)
- Maximum mean weight cycle in a digraph and minimizing cycle time of a logic chip (Q697566) (← links)
- Strongly polynomial-time approximation for a class of bicriteria problems. (Q703276) (← links)
- Optimal spanners for axis-aligned rectangles (Q706725) (← links)
- The cyclical scheduling problem (Q744050) (← links)
- Efficient algorithms for determining 3D biplane imaging geometry (Q813330) (← 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)
- The maximin line problem with regional demand (Q872234) (← links)
- Selecting distances in arrangements of hyperplanes spanned by points. (Q878011) (← links)
- Packing two disks into a polygonal environment. (Q878013) (← 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)
- Submodular function minimization (Q995782) (← links)
- Center location problems on tree graphs with subtree-shaped customers (Q1005232) (← links)
- A fast algorithm for the alpha-connected two-center decision problem (Q1007526) (← links)
- Computing and minimizing the relative regret in combinatorial optimization with interval data (Q1019293) (← links)
- Single facility collection depots location problem in the plane (Q1025297) (← links)
- Dynamic ham-sandwich cuts in the plane (Q1025301) (← links)
- Computing all large sums-of-pairs in \(\mathbb R^n\) and the discrete planar two-watchtower problem (Q1029066) (← 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)
- An adaptive and cost-optimal parallel algorithm for minimum spanning trees (Q1060018) (← links)
