A constant-factor approximation algorithm for the k-median problem (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Performance Guarantees of Local Search for Multiprocessor Scheduling
INFORMS Journal on Computing
Assignment problem in content distribution networks: unsplittable hard-capacitated facility location
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Capacitated domination problem
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Lower-bounded facility location
ACM Transactions on Algorithms (TALG)
Volley: automated data placement for geo-distributed cloud services
NSDI'10 Proceedings of the 7th USENIX conference on Networked systems design and implementation
Budgeted red-blue median and its generalizations
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Network-aware service placement and selection algorithms on large-scale overlay networks
Computer Communications
Unconstrained and constrained fault-tolerant resource allocation
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Generalized machine activation problems
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
A 3-approximation for facility location with uniform capacities
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Capacitated domination: constant factor approximations for planar graphs
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Assignment problem in content distribution networks: Unsplittable hard-capacitated facility location
ACM Transactions on Algorithms (TALG)
A 5-approximation for capacitated facility location
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Multi-aspect group formation using facility location analysis
Proceedings of the Seventeenth Australasian Document Computing Symposium
Kernel search for the capacitated facility location problem
Journal of Heuristics
Deterministic sublinear-time approximations for metric 1-median selection
Information Processing Letters
Approximating the reliable resource allocation problem using inverse dual fitting
CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128
Expert group formation using facility location analysis
Information Processing and Management: an International Journal
| Hi-index | 0.00 |
We show that a 2-variable integer program, defined by m constraints involving coefficients with at most φ bits, can be solved with O(m+φ) arithmetic operations on rational numbers of size O(φ).