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

scientific article; zbMATH DE number 4123286

From MaRDI portal
Jump to:navigation, search

zbMATH Open0685.68032MaRDI QIDQ4203809FDOQ4203809


Authors: Zbigniew J. Czech Edit this on Wikidata


Publication date: 1988



Title of this publication is not available (Why is that?)



Recommendations

  • A Linear Time Algorithm for the k Maximal Sums Problem
  • Efficient algorithms for \(k\) maximum sums
  • Algorithms and Computation
  • An exact algorithm for finding a vector subset with the longest sum
  • Computing and Combinatorics


zbMATH Keywords

maximum-sum subvector problem


Mathematics Subject Classification ID

Algorithms in computer science (68W99)



Cited In (4)

  • Fast vectorization for calculating a moving sum
  • Generalized algorithm for summing the enumerators of suboptimal solutions
  • Efficient algorithms for the maximum sum problems
  • Improving Schroeppel and Shamir’s algorithm for subset sum via orthogonal vectors





This page was built for publication:

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

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