Structural Information and Communication Complexity

DOI10.1007/B98251MaRDI QIDQ5315217zbMATH OpenOpenAlexFDO

Authors Fanny Pascual, Eric Angel, Evripidis Bampis

Publication date 7 September 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b98251

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Recommendations

• Traffic Grooming in Star Networks via Matching Techniques
• Approximating the Traffic Grooming Problem in Tree and Star Networks
• Approximating the traffic grooming problem
• Algorithms and Computation
• Approximating the traffic grooming problem in tree and star networks

Cited in

(7)

• A network flow approach for static and dynamic traffic grooming in WDM networks
• Traffic Grooming in Star Networks via Matching Techniques
• Traffic Groomed Multicasting in Sparse-Splitting WDM Backbone Networks
• A wavelength division multiple access protocol for high-speed local area networks with a passive star topology
• On supporting temporal quality of service in WDMA-based star-coupled optical networks
• A cost-efficient scheduling algorithm for traffic grooming
• Dynamic programming based algorithms for set multicover and multiset multicover problems

This page was built for publication: Structural Information and Communication Complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5315217)