Journal of the ACM (JACM)
| Hi-index | 0.98 |
One paradigm for optimizing the efficiency of solutions to instances of a difficult problem is to factor the problem into subcases and to optimize the solution for each subcase. Although an optimal solution for the general problem may not be found by this approach, near optimal solutions may be found for many particular instances. This is the approach illustrated by the following problem domain. When designing a network (communication, computing etc.) it may be necessary to impose the following constraint: Given N and M with N