Computational geometry: an introduction
Computational geometry: an introduction
Approximation schemes for Euclidean k-medians and related problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Approximating geometrical graphs via “spanners” and “banyans”
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Source sink flows with capacity installation in batches
Discrete Applied Mathematics
Minimum cost capacity installation for multicommodity network flows
Mathematical Programming: Series A and B - Special issue on computational integer programming
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
Journal of the ACM (JACM)
On approximability of the minimum-cost k-connected spanning subgraph problem
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
An O(n log n) Algorithm for Rectilinear Minimal Spanning Trees
Journal of the ACM (JACM)
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
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Approximating the Single-Sink Link-Installation Problem in Network Design
SIAM Journal on Optimization
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
The Single-Sink Buy-at-Bulk LP Has Constant Integrality Gap
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Fast Approximation Schemes for Euclidean Multi-connectivity Problems
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Approximation algorithms for a capacitated network design problem
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
Simpler and better approximation algorithms for network design
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Cost-distance: two metric network design
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
An Approximation Algorithm for Minimum-Cost Network Design
An Approximation Algorithm for Minimum-Cost Network Design
Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Approximation algorithms for node-weighted buy-at-bulk network design
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Improved approximation for single-sink buy-at-bulk
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Approximation schemes for capacitated geometric network design
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
| Hi-index | 0.00 |
The buy-at-bulk network design problem has been extensively studied in the general graph model. In this paper we consider the geometric version of the problem, where all points in a Euclidean space are candidates for network nodes. We present the first general approach for geometric versions of basic variants of the buy-at-bulk network design problem. It enables us to obtain quasi-polynomial-time approximation schemes for basic variants of the buy-at-bulk geometric network design problem with polynomial total demand. Then, for instances with few sinks and low capacity links, we design very fast polynomial-time low-constant approximations algorithms.