scientific article; zbMATH DE number 6469169
From MaRDI portal
Publication:5501284
Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Nonnumerical algorithms (68W05) Programming involving graphs or networks (90C35)
Recommendations
- Models of greedy algorithms for graph problems
- A general model for matroids and the greedy algorithm
- Optimal greedy algorithms for indifference graphs
- scientific article; zbMATH DE number 1875441
- Simple greedy algorithms for fundamental multidimensional graph problems
- Analysis of greedy algorithms on graphs with bounded degrees
- The \(S\)-digraph optimization problem and the greedy algorithm
- Greedoids and searches in directed graphs
- Algorithms for some graph problems on a distributed computational model
- Graph theory: modeling, applications, and algorithms
Cited in
(13)- Priority algorithms for the subset-sum problem
- Priority algorithms for graph optimization problems
- Toward a model for backtracking and dynamic programming
- A stronger model of dynamic programming algorithms
- Approximation and Online Algorithms
- Approximation and Online Algorithms
- Optimization on large interconnected graphs and networks using adiabatic quantum computation
- Optimizing over serial dictatorships
- Optimizing over serial dictatorships
- Hierarchies for classes of priority algorithms for job scheduling
- Models of greedy algorithms for graph problems
- Characterizing sets of jobs that admit optimal greedy-like algorithms
- Randomized priority algorithms
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501284)
