Approximating the selected-internal Steiner tree (Q995588): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 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.tcs.2007.05.035 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2050428285 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof verification and the hardness of approximation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster exact algorithms for steiner trees in planar networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thek-Steiner Ratio in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On component-size bounded Steiner trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Steiner trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner problem in phylogeny is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Computing Steiner Minimal Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Rectilinear Steiner Tree Problem is $NP$-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252319 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4764186 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The full Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952699 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:40, 26 June 2024

scientific article
Language Label Description Also known as
English
Approximating the selected-internal Steiner tree
scientific article

    Statements

    Approximating the selected-internal Steiner tree (English)
    0 references
    0 references
    0 references
    3 September 2007
    0 references
    design and analysis of algorithms
    0 references
    approximation algorithms
    0 references
    Steiner tree
    0 references
    the selected-internal Steiner tree problem
    0 references
    MAX SNP-hard
    0 references

    Identifiers