Skip to main content
Log in

Upper and Lower Bounds for Selection on the Mesh

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract.

A distance-optimal algorithm for selection on the mesh has proved to be elusive, although distance-optimal algorithms for the related problems of routing and sorting have recently been discovered. In this paper we explain, using the notion of adaptiveness, why techniques used in the currently best selection algorithms cannot lead to a distance-optimal algorithm.

For worst-case inputs we apply new techniques to improve the previous best upper bound of 1.22n of Kaklamanis et al. [7] to 1.15n . This improvement is obtained in part by increasing the adaptiveness of previous algorithms.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received May 25, 1995; revised June 1, 1996.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Condon, A., Narayanan, L. Upper and Lower Bounds for Selection on the Mesh . Algorithmica 20, 1–30 (1998). https://doi.org/10.1007/PL00009184

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/PL00009184

Navigation