Toward an Automatic Approach to Greedy Algorithms

DOI10.1007/978-3-642-02270-8_31zbMath1248.68466OpenAlexW1581861746MaRDI QIDQ5321722

Jin-Yun 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

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

Related Items (2)

A problem reduction based approach to discrete optimization algorithm design ⋮ An algebraic approach to population-based evolutionary algorithm generation

Cites Work

• An intersection theorem for supermatroids
• Matroids on convex geometries (cg-matroids)
• The derivation of systolic computations
• An incremental approach to automatic algorithm design
• Matroids and the greedy algorithm
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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