A general approximation technique for constrained forest problems
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Low degree spanning trees of small weight
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Resource-constrained geometric network optimization
Proceedings of the fourteenth annual symposium on Computational geometry
An improved approximation ratio for the minimum latency problem
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Algorithms for facility location problems with outliers
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Improved approximations for tour and tree covers
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
Strong lower bounds for the prize collecting Steiner problem in graphs
Discrete Applied Mathematics - Brazilian symposium on graphs, algorithms and combinatorics
The prize-collecting generalized steiner tree problem via a new approach of primal-dual schema
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem
Computers and Operations Research
A stabilized column generation scheme for the traveling salesman subtour problem
Discrete Applied Mathematics - Special issue: International symposium on combinatorial optimization CO'02
Approximate k-Steiner forests via the Lagrangian relaxation technique with internal preprocessing
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
An efficient cost-sharing mechanism for the prize-collecting Steiner forest problem
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
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
Optimal Efficiency Guarantees for Network Design Mechanisms
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Approximation algorithms for group prize-collecting and location-routing problems
Discrete Applied Mathematics
Approximation and Online Algorithms
A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs
Discrete Applied Mathematics
Quantifying inefficiency in cost-sharing mechanisms
Journal of the ACM (JACM)
Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem
Computers and Operations Research
A primal-dual approximation algorithm for the asymmetric prize-collecting TSP
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
Improved Approximation Algorithms for Prize-Collecting Steiner Tree and TSP
SIAM Journal on Computing
Data reduction for weighted and outlier-resistant clustering
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
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
Inventory and facility location models with market selection
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Prize-collecting Steiner problems on planar graphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
An approximation algorithm for the Generalized k-Multicut problem
Discrete Applied Mathematics
Prize-Collecting steiner network problems
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Improving christofides' algorithm for the s-t path TSP
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Algorithmic expedients for the Prize Collecting Steiner Tree Problem
Discrete Optimization
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
A primal-dual approximation algorithm for the Asymmetric Prize-Collecting TSP
Journal of Combinatorial Optimization
Customized tour recommendations in urban areas
Proceedings of the 7th ACM international conference on Web search and data mining
A Survey of Parallel and Distributed Algorithms for the Steiner Tree Problem
International Journal of Parallel Programming
| Hi-index | 0.00 |