Toward an Automatic Approach to Greedy Algorithms

DOI10.1007/978-3-642-02270-8_31MaRDI QIDQ5321722zbMATH OpenOpenAlexFDO

Authors Jinyun Xue, Zhengkang Zuo, Yu-Jun Zheng

Publication date 14 July 2009

Published in Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-02270-8_31

zbMATH Keywords

greedy algorithmcombinatorial optimization problemsPAR methodproblem singleton

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Recommendations

• A class of greedy algorithms and its relation to greedoids
• Canonical greedy algorithms and dynamic programming
• On the Greedy Solution of Ordering Problems
• The classification of greedy algorithms
• Combinatorial optimization algorithms combining greedy strategies with a limited search procedure

Cites work

• scientific article; zbMATH DE number 3643026 (Why is no real title available?)
• scientific article; zbMATH DE number 3982493 (Why is no real title available?)
• scientific article; zbMATH DE number 3740740 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 526062 (Why is no real title available?)
• scientific article; zbMATH DE number 194642 (Why is no real title available?)
• Algorithms. Design techniques and analysis
• An incremental approach to automatic algorithm design
• An intersection theorem for supermatroids
• Designware: Software development by refinement
• Introduction to algorithms
• Matroids and the greedy algorithm
• Matroids on convex geometries (cg-matroids)
• The derivation of systolic computations

Cited in

(6)

• The application of automated reasoning to formal models of combinatorial optimization
• scientific article; zbMATH DE number 1420817 (Why is no real title available?)
• A problem reduction based approach to discrete optimization algorithm design
• An algebraic approach to population-based evolutionary algorithm generation
• An incremental approach to automatic algorithm design
• An experimental method for the active learning of greedy algorithms

This page was built for publication: Toward an Automatic Approach to Greedy Algorithms

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