Models of greedy algorithms for graph problems
type: Item
instance of: scholarly article
title: Models of greedy algorithms for graph problems
zbMATH Open document ID: 1191.68824
author: Sashka Davis
author: Russell Impagliazzo
published in: Algorithmica
publication date: 2009-08-27T00:00:00Z
Mathematics Subject Classification ID: 68W05
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 5598779
zbMATH Keywords: priority algorithms
zbMATH Keywords: greedy algorithms
zbMATH Keywords: graph optimization problems
MaRDI profile type: Publication
full work available at URL: s00453-007-9124-4
OpenAlex ID: W3135922541
cites work: Toward a model for backtracking and dynamic programming
cites work: Approximation and Online Algorithms
cites work: The power of priority algorithms for facility location and set cover
cites work: The Steiner problem with edge lengths 1 and 2
cites work: Q4223058
cites work: (Incremental) priority algorithms
cites work: Automata, Languages and Programming
cites work: Improved non-approximability results for minimum vertex cover with density constraints
cites work: Introduction to algorithms
cites work: On the hardness of approximating minimum vertex cover
cites work: Improved Approximation Algorithms for the Vertex Cover Problem in Graphs and Hypergraphs
cites work: Approximation algorithms for combinatorial problems
cites work: A fast algorithm for Steiner trees
cites work: Q3090386
cites work: Hierarchies for classes of priority algorithms for job scheduling
cites work: The computation of nearly minimal Steiner trees in graphs
cites work: Tighter Bounds for Graph Steiner Tree Approximation
cites work: Q4782696
cites work: Worst-case performance of Rayward-Smith's Steiner tree heuristic
DOI: 10.1007/S00453-007-9124-4
description: scientific article; zbMATH DE number 5598779