| 21. | The theorems have enabled the development of approximation algorithms for use in graph partition and related problems.
|
| 22. | This enables the simple 2-approximation algorithm for TSP with triangle inequality above to operate more quickly.
|
| 23. | Since the original paper of Goemans and Williamson, SDPs have been applied to develop numerous approximation algorithms.
|
| 24. | An O ( \ log n )-approximation algorithm was developed by Maleq Khan and Gopal Pandurangan.
|
| 25. | A number of approximation algorithms have been developed for the facility location problem and many of its variants.
|
| 26. | There is a simple polynomial-time approximation algorithm with approximation factor 2 : find any maximal matching.
|
| 27. | There is an approximation algorithm with approximation ratio O ( ( \ log n ) ^ \ frac32 ).
|
| 28. | There is a fixed-ratio approximation algorithm to solve any problem in "'MaxSNP " '.
|
| 29. | Currently, Simmons'algorithm is the only approximation algorithm for envy-free cake-cutting with connected pieces.
|
| 30. | She has done some work on network flow algorithms like approximation algorithms for network flows, cut, and clustering problems.
|
