Cost-effectiveness of algorithms

MaRDI QIDQ5249237zbMATH OpenFDO

Authors Graham Farr

Publication date 30 April 2015

Full work available at URL https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/2349/0.html

zbMATH Keywords

algorithmsapproximation algorithmcost effectivenessgraph colouringKolmogorov complexitymatchingoptimisationperformance measure

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Approximation algorithms (68W25)

Recommendations

• Probabilistic quality estimations for combinatorial optimization problems
• scientific article; zbMATH DE number 3999902
• scientific article; zbMATH DE number 4128371
• Methods and applications of algorithmic complexity. Beyond statistical lossless compression
• Basic concepts in algorithms and complexity theory

Cited in

(1)

• THE FASTEST AND SHORTEST ALGORITHM FOR ALL WELL-DEFINED PROBLEMS

This page was built for publication: Cost-effectiveness of algorithms

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