On the complexity of the regenerator location problem treewidth and other parameters (Q896670): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2015.01.036 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2004418970 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some APX-completeness results for cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time algorithms for NP-hard problems restricted to partial k- trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3795218 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time algorithm for finding tree-decompositions of small treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum \(k\)-path vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: The regenerator location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Some Colorful Problems Parameterized by Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing total busy time in parallel scheduling with application to optical networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing regenerator cost in traffic grooming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of the regenerator cost problem in general networks with traffic grooming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for connected dominating sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Complexity of Arc-Weighted Directed Steiner Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online regenerator placement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. II. Algorithmic aspects of tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Optimization of Busy Time on Parallel Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249537 / rank
 
Normal rank

Latest revision as of 05:20, 11 July 2024

scientific article
Language Label Description Also known as
English
On the complexity of the regenerator location problem treewidth and other parameters
scientific article

    Statements

    On the complexity of the regenerator location problem treewidth and other parameters (English)
    0 references
    0 references
    0 references
    0 references
    10 December 2015
    0 references
    optical networks
    0 references
    switching cost
    0 references
    algorithms
    0 references
    parameterized complexity
    0 references
    hardness of approximation
    0 references

    Identifiers

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