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

Priority Algorithms for the Subset-Sum Problem

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

DOI10.1007/978-3-540-73545-8_49zbMATH Open1213.68709OpenAlexW1554277184MaRDI QIDQ3608874FDOQ3608874

Yuli Ye, Allan Borodin

Publication date: 6 March 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73545-8_49




Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Approximation algorithms (68W25)



Cited In (2)

  • On Selecting a Subset Containing the Alternative with the Largest Priority
  • Randomized priority algorithms






This page was built for publication: Priority Algorithms for the Subset-Sum Problem

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

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