Pages that link to "Item:Q5713444"
From MaRDI portal
The following pages link to Approximation and Online Algorithms (Q5713444):
Displaying 19 items.
- Approximating the traffic grooming problem in tree and star networks (Q436821) (← links)
- The chord version for SONET ADMs minimization (Q817808) (← links)
- Hardness and approximation of traffic grooming (Q837166) (← links)
- On minimizing the number of ADMs--tight bounds for an algorithm without preprocessing (Q878685) (← links)
- On minimizing the number of ADMs in a general topology optical network (Q967313) (← links)
- Optimal on-line colorings for minimizing the number of ADMs in optical networks (Q972358) (← links)
- Better bounds for minimizing SONET ADMs (Q1004601) (← links)
- Splittable traffic partition in WDM/SONET rings to minimize SONET ADMs (Q1605303) (← links)
- Traffic partition in WDM/SONET rings to minimize SONET ADMs (Q1810863) (← links)
- Graph decompositions with application to wavelength add-drop multiplexing for minimizing SONET ADMs (Q1861286) (← links)
- Minimizing ADMs on WDM directed fiber trees (Q1884302) (← links)
- Minimization of SONET ADMs in ring networks revisited (Q2380804) (← links)
- Traffic grooming on the path (Q2382667) (← links)
- Minimization of the number of ADMs in SONET rings with maximum throughput with implications to the traffic grooming problem (Q2382677) (← links)
- SONET ADMs minimization with divisible paths (Q2461634) (← links)
- On the Complexity of Approximation and Online Scheduling Problems with Applications to Optical Networks (Q2827800) (← links)
- On-Line Maximum Matching in Complete Multipartite Graphs with Implications to the Minimum ADM Problem on a Star Topology (Q3408178) (← links)
- Hardness and Approximation of Traffic Grooming (Q5387787) (← links)
- Structural Information and Communication Complexity (Q5710090) (← links)
