Approximation and Online Algorithms
From MaRDI portal
Publication:5713444
DOI10.1007/b106130zbMath1124.90321MaRDI QIDQ5713444
Publication date: 14 December 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b106130
68M10: Network design and communication in computer systems
68R10: Graph theory (including graph drawing) in computer science
90B35: Deterministic scheduling theory in operations research
68W25: Approximation algorithms
Related Items
Hardness and Approximation of Traffic Grooming, Approximating the traffic grooming problem in tree and star networks, The chord version for SONET ADMs minimization, Hardness and approximation of traffic grooming, On minimizing the number of ADMs in a general topology optical network, Optimal on-line colorings for minimizing the number of ADMs in optical networks, Better bounds for minimizing SONET ADMs, Traffic grooming on the path, Minimization of the number of ADMs in SONET rings with maximum throughput with implications to the traffic grooming problem, On the Complexity of Approximation and Online Scheduling Problems with Applications to Optical Networks, On-Line Maximum Matching in Complete Multipartite Graphs with Implications to the Minimum ADM Problem on a Star Topology