Dividing and conquering the square
type: Item
instance of: scholarly article
title: Dividing and conquering the square
zbMATH Open document ID: 0783.68058
DOI: 10.1016/0166-218X(93)90004-8
author: Yanyan Li
published in: Discrete Applied Mathematics
publication date: 1993-08-17T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C50
Mathematics Subject Classification ID: 15A15
zbMATH DE Number: 205582
zbMATH Keywords: local search
zbMATH Keywords: grid
zbMATH Keywords: graph
zbMATH Keywords: saddle point
zbMATH Keywords: upper bounds
zbMATH Keywords: local minimum of a matrix
zbMATH Keywords: lower bound
MaRDI profile type: Publication
cites work: On the deterministic complexity of searching local maxima
cites work: Lower bounds on the worst-case complexity of some oracle algorithms
cites work: Generalized Nested Dissection
cites work: Local optimization on graphs
cites work: Best Algorithms for Approximating the Maximum of a Submodular Set Function
full work available at URL: 0166-218x(93)90004-8
OpenAlex ID: W2052642357
description: scientific article; zbMATH DE number 205582