Approximation algorithms for grooming in optical network design (Q551206): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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.2011.03.034 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2051874014 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for the design of SDH/SONET networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The SONET edge‐partition problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better bounds for minimizing SONET ADMs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness and approximation of traffic grooming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting Permutations by Reversals and Eulerian Cycle Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing cycles in undirected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921712 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms and hardness results for cycle packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximability of Packing Disjoint Cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pattern matching with address errors / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Cost of Interchange Rearrangement in Strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization, approximation, and complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-Completeness of Some Edge-Partition Problems / rank
 
Normal rank

Latest revision as of 07:30, 4 July 2024

scientific article
Language Label Description Also known as
English
Approximation algorithms for grooming in optical network design
scientific article

    Statements

    Approximation algorithms for grooming in optical network design (English)
    0 references
    0 references
    14 July 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    traffic grooming
    0 references
    optical network
    0 references
    approximation algorithms
    0 references
    cycle packing
    0 references
    0 references