Make it practical: a generic linear-time algorithm for solving maximum-weightsum problems

DOI10.1145/351240.351254MaRDI QIDQ2943363zbMATH OpenOpenAlexFDO

Authors Isao Sasano, Zhenjiang Hu, Masato Takeichi, Mizuhito Ogawa

Publication date 11 September 2015

Published in Proceedings of the fifth ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/351240.351254

zbMATH Keywords

fusionlinear-time algorithmprogram calculationtuplingmaximum-weightsum problemmutumorphism

Mathematics Subject Classification ID

Data structures (68P05) Nonnumerical algorithms (68W05)

Recommendations

• Theoretical Aspects of Computing – ICTAC 2005
• scientific article; zbMATH DE number 841593
• Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
• Fast algorithms for the maximum convolution problem
• An optimal time algorithm for finding a maximum weight independent set in a tree

Cited in

(3)

• Theoretical Aspects of Computing – ICTAC 2005
• Maximum marking problems
• A short cut to optimal sequences

This page was built for publication: Make it practical: a generic linear-time algorithm for solving maximum-weightsum problems

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