Toward an Automatic Approach to Greedy Algorithms
From MaRDI portal
Publication:5321722
DOI10.1007/978-3-642-02270-8_31zbMath1248.68466MaRDI QIDQ5321722
Yu-Jun Zheng, Jin-Yun Xue, Zhengkang Zuo
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
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Related Items
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