A fast random greedy algorithm for the component commonality problem

DOI10.1007/3-540-68530-8_19MaRDI QIDQ4252032zbMATH OpenFDO

Authors Andreas Nolte, R. Kannan

Publication date 17 June 1999

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

Full work available at URL https://doi.org/10.1007/3-540-68530-8_19

zbMATH Keywords

component commonality problemrandomized greedy algorithmstochastic optimization

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05) Stochastic programming (90C15)

Recommendations

• A Randomized Algorithm to Optimize Over Certain Convex Sets
• The component commonality problem in a real multidimensional space: an algorithmic approach
• scientific article; zbMATH DE number 3974320
• Approximation and Online Algorithms
• scientific article; zbMATH DE number 3854438

Cited in

(1)

• The component commonality problem in a real multidimensional space: an algorithmic approach

This page was built for publication: A fast random greedy algorithm for the component commonality problem

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