Worst-case performance of Wong's Steiner tree heuristic (Q2489899): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2005.05.027 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2045031547 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2776545 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4139967 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5567717 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed Steiner Tree Problem On A Graph: Models, Relaxations And Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum branchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dual-Based Procedure for Uncapacitated Facility Location / rank
 
Normal rank
Property / cites work
 
Property / cites work: A catalog of steiner tree formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved approximation scheme for the Group Steiner Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for Steiner trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for the steiner tree problem in directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3760270 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approach for the Steiner problem in directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Comparison of Two Simulated Annealing Algorithms Applied to the Directed Steiner Problem on Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2741494 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved algorithms for the Steiner problem in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3874241 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case performance of some heuristics for Steiner's problem in directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The primal-dual method for approximation algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner problem in networks: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dual ascent approach for steiner tree problems on a directed graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A series of approximation algorithms for the acyclic directed Steiner tree problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:29, 24 June 2024

scientific article
Language Label Description Also known as
English
Worst-case performance of Wong's Steiner tree heuristic
scientific article

    Statements

    Worst-case performance of Wong's Steiner tree heuristic (English)
    0 references
    0 references
    0 references
    28 April 2006
    0 references
    Steiner problem
    0 references
    Wong's heuristic
    0 references
    Worst-case performance
    0 references
    Approximation algorithms
    0 references

    Identifiers