Chudak, 1998 - Google Patents
Improved approximation algorithms for uncapacitated facility locationChudak, 1998
View PDF- Document ID
- 11768893176023966043
- Author
- Chudak F
- Publication year
- Publication venue
- International Conference on Integer Programming and Combinatorial Optimization
External Links
Snippet
We consider the uncapacitated facility location problem. In this problem, there is a set of locations at which facilities can be built; a fixed cost fi is incurred if a facility is opened at location i. Further-more, there is a set of demand locations to be serviced by the opened …
- 238000000034 method 0 abstract description 15
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/54—Store-and-forward switching systems
- H04L12/56—Packet switching systems
- H04L12/5601—Transfer mode dependent, e.g. ATM
- H04L2012/5629—Admission control
- H04L2012/5631—Resource management and allocation
- H04L2012/5632—Bandwidth allocation
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Chudak | Improved approximation algorithms for uncapacitated facility location | |
| Chudak et al. | Improved approximation algorithms for the uncapacitated facility location problem | |
| Fotakis | On the competitive ratio for online facility location | |
| Amaldi et al. | On the computational complexity of the virtual network embedding problem | |
| Horton | A polynomial-time algorithm to find the shortest cycle basis of a graph | |
| Braud-Santoni et al. | Fast byzantine agreement | |
| Doeringer et al. | Routing on longest-matching prefixes | |
| Mahdian et al. | Universal facility location | |
| Hochbaum | An efficient algorithm for image segmentation, Markov random fields and related problems | |
| Mattia | The robust network loading problem with dynamic routing | |
| Fink et al. | Maximum betweenness centrality: approximability and tractable cases | |
| Bhattacharya et al. | Design of dynamic algorithms via primal-dual method | |
| Yi et al. | Edge deletion algorithms for minimizing spread in SIR epidemic models | |
| Chen et al. | Optimal capacity modification for many-to-one matching problems | |
| Fotakis | On the competitive ratio for online facility location | |
| Orlin et al. | A fast maximum flow algorithm | |
| Shmoys et al. | A constant approximation algorithm for the a priori traveling salesman problem | |
| Le et al. | Optimal fault-tolerant spanners in euclidean and doubling metrics: Breaking the ω (log n) lightness barrier | |
| Chen et al. | Improved approximation algorithms for the spanning star forest problem | |
| Riege et al. | An exact 2.9416 n algorithm for the three domatic number problem | |
| Wang et al. | Probing to minimize | |
| Zheng et al. | Finding minimum-cost paths with minimum sharability | |
| Chung et al. | Braess's paradox in expanders | |
| Even et al. | Distributed set cover approximation: primal-dual with optimal locality | |
| Nutov | Parameterized algorithms for node connectivity augmentation problems |