A polylogarithmic approximation for computing non-metric terminal Steiner trees (Q407565): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C85 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6018484 / rank
 
Normal rank
Property / zbMATH Keywords
 
approximation algorithms
Property / zbMATH Keywords: approximation algorithms / rank
 
Normal rank
Property / zbMATH Keywords
 
terminal Steiner tree
Property / zbMATH Keywords: terminal Steiner tree / rank
 
Normal rank
Property / zbMATH Keywords
 
group Steiner tree
Property / zbMATH Keywords: group Steiner tree / rank
 
Normal rank
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.ipl.2010.07.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2054665259 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved LP-based approximation for steiner tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Full and Bottleneck Full Steiner Tree Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximation algorithms for the terminal Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tight bound on approximating arbitrary metrics by tree metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the terminal Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the terminal Steiner tree problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The full Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for terminal Steiner trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for metric facility location and <i>k</i> -Median problems using the primal-dual schema and Lagrangian relaxation / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 01:17, 5 July 2024

scientific article
Language Label Description Also known as
English
A polylogarithmic approximation for computing non-metric terminal Steiner trees
scientific article

    Statements

    A polylogarithmic approximation for computing non-metric terminal Steiner trees (English)
    0 references
    0 references
    0 references
    27 March 2012
    0 references
    0 references
    approximation algorithms
    0 references
    terminal Steiner tree
    0 references
    group Steiner tree
    0 references
    0 references