Models of greedy algorithms for graph problems (Q834580): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Toward a model for backtracking and dynamic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation and Online Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation and Online Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The power of priority algorithms for facility location and set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner problem with edge lengths 1 and 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4223058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: (Incremental) priority algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation and Online Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved non-approximability results for minimum vertex cover with density constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of approximating minimum vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation Algorithms for the Vertex Cover Problem in Graphs and Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for Steiner trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3090386 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchies for classes of priority algorithms for job scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computation of nearly minimal Steiner trees in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tighter Bounds for Graph Steiner Tree Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4782696 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case performance of Rayward-Smith's Steiner tree heuristic / rank
 
Normal rank

Revision as of 21:32, 1 July 2024

scientific article
Language Label Description Also known as
English
Models of greedy algorithms for graph problems
scientific article

    Statements

    Models of greedy algorithms for graph problems (English)
    0 references
    0 references
    0 references
    0 references
    27 August 2009
    0 references
    priority algorithms
    0 references
    greedy algorithms
    0 references
    graph optimization problems
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references