Some Recurrence Relations of Recursive Minimization

DOI10.1137/0603002zbMATH Open0498.05004OpenAlexW2030527372MaRDI QIDQ3963012FDOQ3963012

Authors: Charles J. K. Batty, M. J. Pelling, Douglas G. Rogers 

Publication date: 1982

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0603002

zbMATH Keywords

convex sequencesrecursive minimization problem

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10) Recurrences (11B37)

Cites Work

• A Lower Bound for the Monomer-Dimer Problem
• Some Maximal Solutions of the Generalized Subadditive Inequality
• A sorting function
• Some Theorems on Sorting
• ON THE RATE OF CONVERGENCE TO THE CONNECTIVE CONSTANT OF THE HYPERCUBICAL LATTICE
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (5)

• A family of restricted subadditive recursions
• The maximal solution of a restricted subadditive inequality in numerical analysis
• Some Maximal Solutions of the Generalized Subadditive Inequality
• Divide-and-conquer recurrences associated with generalized heaps, optimal merge, and related structures
• Solutions of two minmax recurrences in parallel processing with variable recombination overhead

This page was built for publication: Some Recurrence Relations of Recursive Minimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3963012)