Lower bounds for two-period grooming via linear programming duality (Q3548731): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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.1002/net.20251 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4230698936 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing SONET ADMs in unidirectional WDM rings with grooming ratio 3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Traffic Grooming in Unidirectional Wavelength-Division Multiplexed Rings with Grooming Ratio<i>C</i>= 6 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grooming in unidirectional rings: \(K_{4}-e\) designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3411976 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grooming for two-period optical networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding path designs in 4-cycle systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2716085 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:59, 28 June 2024

scientific article
Language Label Description Also known as
English
Lower bounds for two-period grooming via linear programming duality
scientific article

    Statements

    Lower bounds for two-period grooming via linear programming duality (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    17 December 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    optical networks
    0 references
    traffic grooming
    0 references
    graph decomposition
    0 references
    combinatorial designs
    0 references
    linear programming duality
    0 references
    0 references