Batched dynamic solutions to decomposable searching problems
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 5226440
- A Dynamic Programming Solution to Bounded Dejittering Problems
- Finding good decompositions for dynamic programming on dense graphs
- A decomposition-based implementation of search strategies
- Simultaneous batching and scheduling using dynamic decomposition on a grid
- Space-Efficient Parallel Algorithms for Combinatorial Search Problems
- scientific article; zbMATH DE number 1303612
- scientific article; zbMATH DE number 1163099
- Dynamic programming in the problem of decomposition optimization
- Efficiently parallelizable problems on a class of decomposable graphs
Cited in
(11)- The region approach for computing relative neighbourhood graphs in the \(L_ p\) metric
- A practical divide-and-conquer algorithm for the rectangle intersection problem
- Off-line dynamic maintenance of the width of a planar point set
- Rectilinear Steiner tree heuristics and minimum spanning tree algorithms using geographic nearest neighbors
- Efficient splitting and merging algorithms for order decomposable problems.
- An algorithm for handling many relational calculus queries efficiently.
- The 2-center problem in three dimensions
- FAST SOFTWARE FOR BOX INTERSECTIONS
- Counting and reporting red/blue segment intersections
- External-memory algorithms for processing line segments in geographic information systems
- Buffered partially-persistent external-memory search trees
This page was built for publication: Batched dynamic solutions to decomposable searching problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3707419)
