An FPT algorithm in polynomial space for the directed Steiner tree problem with limited number of diffusing nodes (Q477657): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Dominique Barith / rank
Normal rank
 
Property / author
 
Property / author: Dominique Barith / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68R10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C85 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6378669 / rank
 
Normal rank
Property / zbMATH Keywords
 
directed Steiner tree
Property / zbMATH Keywords: directed Steiner tree / rank
 
Normal rank
Property / zbMATH Keywords
 
parameterized complexity
Property / zbMATH Keywords: parameterized complexity / rank
 
Normal rank
Property / zbMATH Keywords
 
dynamic programming
Property / zbMATH Keywords: dynamic programming / rank
 
Normal rank
Property / zbMATH Keywords
 
algorithms
Property / zbMATH Keywords: algorithms / rank
 
Normal rank
Property / zbMATH Keywords
 
combinatorial problems
Property / zbMATH Keywords: combinatorial problems / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2014.09.027 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2005716729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fourier meets M\"{o}bius: fast subset convolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: The steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing optimal Steiner trees in polynomial space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic programming for minimum Steiner trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning spiders and light-splitting switches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast polynomial-space algorithms using inclusion-exclusion. Improving on Steiner tree and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on distributed multicast routing in point-to-point networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3679220 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5294062 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed Steiner Tree with Branching Constraint / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 11:03, 9 July 2024

scientific article
Language Label Description Also known as
English
An FPT algorithm in polynomial space for the directed Steiner tree problem with limited number of diffusing nodes
scientific article

    Statements

    An FPT algorithm in polynomial space for the directed Steiner tree problem with limited number of diffusing nodes (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    9 December 2014
    0 references
    directed Steiner tree
    0 references
    parameterized complexity
    0 references
    dynamic programming
    0 references
    algorithms
    0 references
    combinatorial problems
    0 references

    Identifiers