The greedy algorithm as a combinatorial principle

MaRDI QIDQ5946799zbMATH OpenFDO

Authors U. Faigle

Publication date 8 November 2001

Published in Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/121652, http://www.emis.de/journals/SLC/opapers/s05faigle.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 863497
• scientific article; zbMATH DE number 169611
• A ranking model for the greedy algorithm and discrete convexity
• A framework for the greedy algorithm
• On simple combinatorial optimization problems. A collection of contributions in honour of Jack van Lint

Cited in

(2)

• Greedy algorithm with gaps
• scientific article; zbMATH DE number 3976790 (Why is no real title available?)

This page was built for publication: The greedy algorithm as a combinatorial principle

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