A General Approximation Technique for Constrained Forest Problems
SIAM Journal on Computing
The primal-dual method for approximation algorithms and its application to network design problems
Approximation algorithms for NP-hard problems
A 2.5-factor approximation algorithm for the k-MST problem
Information Processing Letters
A 3-approximation for the minimum tree spanning k vertices
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Sharing the cost of muliticast transmissions (preliminary version)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
A faster implementation of the Goemans-Williamson clustering algorithm
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
Pricing multicasting in more practical network models
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for time-dependent orienteering
Information Processing Letters
Approximation Algorithms for Time-Dependent Orienteering
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
The Dynamic Vertex Minimum Problem and Its Application to Clustering-Type Approximation Algorithms
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Strong lower bounds for the prize collecting Steiner problem in graphs
Discrete Applied Mathematics - Brazilian symposium on graphs, algorithms and combinatorics
Saving an epsilon: a 2-approximation for the k-MST problem in graphs
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Pricing multicasting in more flexible network models
ACM Transactions on Algorithms (TALG)
A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem
Computers and Operations Research
Near-optimal sensor placements: maximizing information while minimizing communication cost
Proceedings of the 5th international conference on Information processing in sensor networks
A practical pricing model of inter-domain multicasting based on game theory
NetGames '06 Proceedings of 5th ACM SIGCOMM workshop on Network and system support for games
Primal-dual approximation algorithms for the Prize-Collecting Steiner Tree Problem
Information Processing Letters
Approximation algorithms for prize collecting forest problems with submodular penalty functions
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches
Computational Optimization and Applications
Elementary approximation algorithms for prize collecting Steiner tree problems
Information Processing Letters
Bicriteria Approximation Tradeoff for the Node-Cost Budget Problem
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Strong Formulations for 2-Node-Connected Steiner Network Problems
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Bicriteria approximation tradeoff for the node-cost budget problem
ACM Transactions on Algorithms (TALG)
Approximation and Online Algorithms
A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs
Discrete Applied Mathematics
A Prize-Collecting Steiner Tree Approach for Transduction Network Inference
CMSB '09 Proceedings of the 7th International Conference on Computational Methods in Systems Biology
Efficient informative sensing using multiple robots
Journal of Artificial Intelligence Research
Efficient planning of informative paths for multiple robots
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem
Computers and Operations Research
A new ILP formulation for 2-root-connected prize-collecting Steiner networks
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Improved approximation algorithms for the minimum latency problem via prize-collecting strolls
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Robust sensor placements at informative and communication-efficient locations
ACM Transactions on Sensor Networks (TOSN)
Improved Approximation Algorithms for Prize-Collecting Steiner Tree and TSP
SIAM Journal on Computing
Euclidean prize-collecting steiner forest
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Prize-collecting steiner networks via iterative rounding
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Prize-collecting Steiner problems on planar graphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Prize-Collecting steiner network problems
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
SigSpot: mining significant anomalous regions from time-evolving networks (abstract only)
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Reduction tests for the prize-collecting Steiner problem
Operations Research Letters
Algorithmic expedients for the Prize Collecting Steiner Tree Problem
Discrete Optimization
A better approximation algorithm for the budget prize collecting tree problem
Operations Research Letters
Prize-collecting steiner network problems
ACM Transactions on Algorithms (TALG)
Tight compact models and comparative analysis for the prize collecting Steiner tree problem
Discrete Applied Mathematics
| Hi-index | 0.00 |