Some principles for dynamizing decomposable searching problems

DOI10.1016/0020-0190(81)90077-6zbMath0453.68029OpenAlexW2074584192MaRDI QIDQ1149253

Jan van Leeuwen, Mark H. Overmars

Publication date: 1981

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://dspace.library.uu.nl/handle/1874/15902

zbMATH Keywords

data structuresdesign of efficient algorithmsdynamization method

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)

Related Items

AN EFFICIENT PARALLEL ALGORITHM FOR THE ASSIGNMENT PROBLEM ON THE PLANE∗, Efficient splitting and merging algorithms for order decomposable problems, General methods for 'all elements' and 'all pairs' problems, Optimal dynamization of decomposable searching problems, Efficient splitting and merging algorithms for order decomposable problems.

Cites Work

• Two general methods for dynamizing decomposable searching problems
• Decomposable searching problems
• Unnamed Item