The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
In this paper, a graph partitioning problem that arises in the design of SONET/SDH networks is defined and formalized. Approximation algorithms with performance guarantees are presented. To solve this problem efficiently in practice, fast greedy algorithms and a tabu-search method are proposed and analyzed by means of an experimental study.
In this paper, a graph partitioning problem that arises in the design of
SONET/SDH networks is defined and formalized. Approximation algorithms with
performance guarantees are presented. To solve this problem efficiently in
practice, fast greedy algorithms and a tabu-search method are proposed and
analyzed by means of an experimental study.
Download Results (CSV)