Improved algorithms for fault tolerant facility location
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Profit-earning facility location
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
A constant factor approximation for the single sink edge installation problems
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Provisioning a virtual private network: a network design problem for multicommodity flow
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
A new greedy approach for facility location problems
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Simultaneous optimization for concave costs: single sink aggregation or single source buy-at-bulk
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
Integrated Logistics: Approximation Algorithms Combining Facility Location and Network Design
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Simpler and better approximation algorithms for network design
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
Journal of the ACM (JACM)
Optimal placement of NAK-suppressing agents for reliable multicast: a partial deployment case
Proceedings of the 2004 ACM symposium on Applied computing
Approximating the two-level facility location problem via a quasi-greedy approach
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Online algorithms for network design
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Proceedings of the 10th annual international conference on Mobile computing and networking
On the Internet Delay-Based Clustering
ANSS '05 Proceedings of the 38th annual Symposium on Simulation
On the approximability of some network design problems
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Achieving anonymity via clustering
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A review of hierarchical facility location models
Computers and Operations Research
Approximation via cost sharing: Simpler and better approximation algorithms for network design
Journal of the ACM (JACM)
A Transportation Problem with Minimum Quantity Commitment
Transportation Science
Terminal backup, 3D matching, and covering cubic graphs
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Stochastic analyses for online combinatorial optimization problems
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Lower-bounded facility location
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
On the approximability of some network design problems
ACM Transactions on Algorithms (TALG)
Infrastructure Leasing Problems
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Load-balanced agent activation for value-added network services
Computer Communications
On the optimization of storage capacity allocation for content distribution
Computer Networks: The International Journal of Computer and Telecommunications Networking
Efficient algorithms for the 2-gathering problem
ACM Transactions on Algorithms (TALG)
A new approximation algorithm for the multilevel facility location problem
Discrete Applied Mathematics
Improved combinatorial approximation algorithms for the k-level facility location problem
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
Importance sampling via load-balanced facility location
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Achieving anonymity via clustering
ACM Transactions on Algorithms (TALG)
Lower-bounded facility location
ACM Transactions on Algorithms (TALG)
Theoretical Computer Science
Computers and Operations Research
Terminal Backup, 3D Matching, and Covering Cubic Graphs
SIAM Journal on Computing
A clustering-based selective probing framework to support internet quality of service routing
IWDC'05 Proceedings of the 7th international conference on Distributed Computing
Online view maintenance under a response-time constraint
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Approximating buy-at-bulk and shallow-light k-Steiner trees
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Approximation algorithms for the k-median problem
Efficient Approximation and Online Algorithms
Computers and Industrial Engineering
| Hi-index | 0.00 |
For any positive integers r and n, let H(r,n) denote the family of graphs on n vertices with maximum degree r, and let H(r,n,n) denote the family of bipartite graphs H on 2n vertices with n vertices in each vertex class, and with maximum degree r. On ...