scientific article; zbMATH DE number 6469169
From MaRDI portal
Publication:5501284
zbMath1317.68258MaRDI QIDQ5501284
Sashka Davis, Russell Impagliazzo
Publication date: 3 August 2015
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (7)
Hierarchies for classes of priority algorithms for job scheduling ⋮ Optimization on large interconnected graphs and networks using adiabatic quantum computation ⋮ Toward a model for backtracking and dynamic programming ⋮ Characterizing sets of jobs that admit optimal greedy-like algorithms ⋮ A stronger model of dynamic programming algorithms ⋮ Randomized priority algorithms ⋮ Priority algorithms for the subset-sum problem
This page was built for publication:
