Searching for "The Design of Divide and Conquer Algorithms." – sorted by Relevance.
5 documents found, showing 1 through 5.
-
Unfair Problems and Randomized Algorithms for Metrical Task Systems
- …, Rabani and Saks [Blum et al. 1992]. This theorem allows one to design divide and conquer algorithms…
- Cited by 13 (3 self) – Add To MetaCart
-
Fast Combinatorial Algorithms for Packing and Covering Problems
- … [15]. This in turn is used in the design of divide and conquer algorithms [5]. Multicommodity flow…
- Cited by 5 (0 self) – Add To MetaCart
-
Graph separators: a parameterized view
- …-nding strategies in order to get divide and conquer algorithms with constants which are better than those…
- Cited by 30 (13 self) – Add To MetaCart
-
Optimal Binary Space Partitions for Orthogonal Objects
- … cutting and binary space partitioning to facilitate the design of divide and conquer algorithms…
- Cited by 1 (0 self) – Add To MetaCart
-
Mesh Connected Computers with Fixed and Reconfigurable Buses: Packet Routing, Sorting, and Selection
- … of divide and conquer algorithms, one has to partition the problem into as equally sized subproblems…
- Cited by 23 (10 self) – Add To MetaCart
Showing 1 through 5.
