A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Greedy Algorithms in Survivable Optical Networks
[chapter]

2008
*
Greedy Algorithms
*

feasible region or search space. Typically, D is some subset of the Euclidean space and is a set with limited elements. The elements of D are called candidate solution or feasible solution. Such a formulation is an optimization problem and the feasible solution that minimizes or maximizes the objective function is the optimal solution. Advanced algorithms We can get the optimal solution by enumerating all possible candidate solutions and comparing the value of objective function. However, it is

doi:10.5772/6348
fatcat:nv3bnkws5bbahisjtxvt6td4cu