Cost-effectiveness of algorithms

MaRDI QIDQ5249237zbMATHFDO

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

algorithmsoptimisationmatchingapproximation algorithmKolmogorov complexitygraph colouringperformance measurecost effectiveness

Mathematics Subject Classification ID

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

Recommendations

• Probabilistic quality estimations for combinatorial optimization problems
• Publication:4726236
• 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)