Recurrence relations based on minimization and maximization

DOI10.1016/0022-247X(85)90170-2zbMath0597.65060MaRDI QIDQ1079343

Edward M. Reingold, Sanjiv Kapoor

Publication date: 1985

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

zbMATH Keywords

dynamic programminganalysis of algorithmsrecurrencesdivide and conquer techniques

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Dynamic programming (90C39) Discrete mathematics in relation to computer science (68R99)

Related Items (2)

An asymptotic theory for recurrence relations based on minimization and maximization. ⋮ On the cost of optimal alphabetic code trees with unequal letter costs

Cites Work

• Recurrence relations based on minimization
• On a Greedy Heuristic for Complete Matching
• Divide and Conquer Heuristics for Minimum Weighted Euclidean Matching
• Unnamed Item
• Unnamed Item

This page was built for publication: Recurrence relations based on minimization and maximization