Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in
Help

Publication:1168763: Difference between revisions

From MaRDI portal
Publication:1168763
Jump to:navigation, search

Import240129110113 (talk | contribs)

1 user groups
bot
7,163,963 edits
|
VisualWikitext
Latest revision as of 04:58, 31 January 2024 view source
Import240129110113 (talk | contribs)
Bots
7,163,963 edits
Created automatically from import240129110113
 
(No difference)

Latest revision as of 04:58, 31 January 2024

DOI10.1007/BF00625278zbMATH Open0493.68104MaRDI QIDQ1168763FDOQ1168763

Raul J. Ramirez, J. Ian Munro, Frank Wm. Tompa

Publication date: 1982

Published in: Acta Informatica (Search for Journal in Brave)




zbMATH Keywords

data structuresdatabasesdynamic programming algorithmshortest route problemperformance deterioration


Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Dynamic programming (90C39) Data structures (68P05)


Cites Work

  • Title not available (Why is that?)
  • The art and theory of dynamic programming
  • Optimum data base reorganization points







This page was built for publication: Optimum reorganization points for arbitrary database costs

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1168763&oldid=13235041"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 31 January 2024, at 04:58. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki