Line System Design and a Generalized Coloring Problem
Authors:
- 1 January 2003
- book chapter
- Published by Springer Nature
- p. 19-30
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- A polynomial time approximation scheme for the SONET ring loading problemBell Labs Technical Journal, 2002
- An Efficient Algorithm for the Ring Loading Problem with Integer Demand SplittingSIAM Journal on Discrete Mathematics, 2001
- Approximation Results for the Optimum Cost Chromatic Partition ProblemJournal of Algorithms, 2000
- Minimum Color Sum of Bipartite GraphsJournal of Algorithms, 1998
- On Chromatic Sums and Distributed Resource AllocationInformation and Computation, 1998
- Approximating circular arc colouring and bandwidth allocation in all-optical ring networks1998
- An optimization problem related to balancing loads on SONET ringsTelecommunication Systems, 1994
- Approximation algorithms for the chromatic sum1991
- An introduction to chromatic sums1989
- The Complexity of Coloring Circular Arcs and ChordsSIAM Journal on Algebraic Discrete Methods, 1980