Loading...
Please wait, while we are loading the content...
Similar Documents
Simpler and Better Approximation Algorithms for Network Design (2003)
| Content Provider | CiteSeerX |
|---|---|
| Author | Gupta, Anupam Kumar, Amit Roughgarden, Tim |
| Description | In Proceedings of the 35th Annual ACM Symposium on Theory of Computing We give simple and easy-to-analyze randomized approximation algorithms for several well-studied NP-hard network design problems. Our algorithms improve over the previously best known approximation ratios. Our main results are the following. |
| File Format | |
| Language | English |
| Publisher Date | 2003-01-01 |
| Access Restriction | Open |
| Subject Keyword | Approximation Ratio Network Design Better Approximation Algorithm Main Result Easy-to-analyze Randomized Approximation Algorithm |
| Content Type | Text |
| Resource Type | Article |