Work

Finding the saddlepoint faster than sorting

Year: 2024

Type: conference-paper

Abstract: A saddlepoint of an n × n matrix A is an entry of A that is a maximum in its row and a minimum in its column. Knuth (1968) gave several different algorithms for finding a saddlepoint. The worst-case running time of these algorithms is Θ(n2), and Llewellyn, Tovey, and Trick (1988) showed that this cannot be improved, as in the worst case all entries of A may need to be queried.

Source: Society for Industrial and Applied Mathematics eBooks

DOI: 10.1137/1.9781611977936.17

Authors: Justin Dallant, Frederik Haagensen, Riko Jacob, László Kozma, Sebastian Wild

Institutions: Université Libre de Bruxelles, IT University of Copenhagen, Freie Universität Berlin, University of Liverpool

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funders: Deutsche Forschungsgemeinschaft, Fédération Wallonie-Bruxelles, Fonds pour la Formation à la Recherche dans l’Industrie et dans l’Agriculture

OpenAlex ID: W4390579115

FWCI: 1.32

Cites:

Cited by: 2

Related to: 10