A General Approximation Technique for Constrained Forest Problems
SIAM Journal on Computing
A nearly best-possible approximation algorithm for node-weighted Steiner trees
Journal of Algorithms
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
Improved methods for approximating node weighted Steiner trees and connected dominating sets
Information and Computation
Efficient recovery from power outage (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
A deterministic algorithm for the cost-distance problem
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for constrained for constrained node weighted steiner tree problems
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
Approximation algorithms
Approximating the Single-Sink Link-Installation Problem in Network Design
SIAM Journal on 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
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
Probabilistic approximation of metric spaces and its algorithmic applications
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Hardness of Buy-at-Bulk Network Design
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
A tight bound on approximating arbitrary metrics by tree metrics
Journal of Computer and System Sciences - Special issue: STOC 2003
On non-uniform multicommodity buy-at-bulk network design
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Multicommodity flow, well-linked terminals, and routing problems
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Improved approximation algorithms for minimum-weight vertex separators
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Oblivious routing on node-capacitated and directed graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On the approximability of some network design problems
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems
Journal of Computer and System Sciences - Special issue on FOCS 2001
Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
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
Set connectivity problems in undirected graphs and the directed Steiner network problem
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation Algorithms for Buy-at-Bulk Geometric Network Design
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Approximating Some Network Design Problems with Node Costs
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Competitive cost sharing with economies of scale
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Approximating Steiner networks with node weights
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Set connectivity problems in undirected graphs and the directed steiner network problem
ACM Transactions on Algorithms (TALG)
Approximation Algorithms for Nonuniform Buy-at-Bulk Network Design
SIAM Journal on Computing
Approximating Steiner Networks with Node-Weights
SIAM Journal on Computing
Approximating k-generalized connectivity via collapsing HSTs
Journal of Combinatorial Optimization
Approximating some network design problems with node costs
Theoretical Computer Science
| Hi-index | 0.00 |
We present algorithms with poly-logarithmic approximation ratios for the buy-at-bulk network design problem in the node-weighted setting. We obtain the following results where h is the number of pairs in the input. • On O(log h) approximation for the single-sink non-uniform buy-at-bulk network design. Unless P = NP this ratio is tight up to constant factors. • An O(log4 h) approximation for the multi-commodity non-uniform buy-at-bulk network design problem.