When trees collide: an approximation algorithm for the generalized Steiner problem on networks
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Competitive distributed file allocation
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
A General Approximation Technique for Constrained Forest Problems
SIAM Journal on Computing
On-line generalized Steiner problem
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Greedy Algorithms for the On-Line Steiner Tree and Generalized Steiner Problems
WADS '93 Proceedings of the Third Workshop on Algorithms and Data Structures
On-Line Distributed Data Management
ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Polynomial Time Approximation Scheme for Symmetric Rectilinear Steiner Arborescence Problem
Journal of Global Optimization
Invited Lecture: Online Algorithms: A Study of Graph-Theoretic Concepts
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
A general approach to online network optimization problems
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Resource optimization in QoS multicast routing of real-time multimedia
IEEE/ACM Transactions on Networking (TON)
Online algorithms for network design
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
On-line generalized Steiner problem
Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
A general approach to online network optimization problems
ACM Transactions on Algorithms (TALG)
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Improved bounds for the online steiner tree problem in graphs of bounded edge-asymmetry
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Online and stochastic survivable network design
Proceedings of the forty-first annual ACM symposium on Theory of computing
Online Primal-Dual Algorithms for Covering and Packing
Mathematics of Operations Research
The Design of Competitive Online Algorithms via a Primal: Dual Approach
Foundations and Trends® in Theoretical Computer Science
Online Priority Steiner Tree Problems
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Designing Network Protocols for Good Equilibria
SIAM Journal on Computing
Approximating k-generalized connectivity via collapsing HSTs
Journal of Combinatorial Optimization
Approximability of capacitated network design
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
An O(log n)-competitive algorithm for online constrained forest problems
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Online Optimization with Uncertain Information
ACM Transactions on Algorithms (TALG)
The node-weighted steiner problem in graphs of restricted node weights
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Online primal-dual algorithms for covering and packing problems
ESA'05 Proceedings of the 13th annual European conference on Algorithms
On the competitiveness of the online asymmetric and euclidean steiner tree problems
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
The power of deferral: maintaining a constant-competitive steiner tree online
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |