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
Strong lower bounds for the prize collecting Steiner problem in graphs
Discrete Applied Mathematics - Brazilian symposium on graphs, algorithms and combinatorics
Mobile backbone networks --: construction and maintenance
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
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
Heuristics for automated knowledge source integration and service composition
Computers and Operations Research
The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches
Computational Optimization and Applications
Two Constant Approximation Algorithms for Node-Weighted Steiner Tree in Unit Disk Graphs
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
HM '08 Proceedings of the 5th International Workshop on Hybrid Metaheuristics
A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs
Discrete Applied Mathematics
Combinatorial optimization in system configuration design
Automation and Remote Control
Construction and Maintenance of Wireless Mobile Backbone Networks
IEEE/ACM Transactions on Networking (TON)
The node-weighted steiner problem in graphs of restricted node weights
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Algorithmic expedients for the Prize Collecting Steiner Tree Problem
Discrete Optimization
| Hi-index | 0.00 |