STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
A General Approximation Technique for Constrained Forest Problems
SIAM Journal on Computing
Improved approximation guarantees for minimum-weight k-trees and prize-collecting salesmen
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
A constant-factor approximation algorithm for the k MST problem (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
Journal of the ACM (JACM)
An improved approximation ratio for the minimum latency problem
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
A 3-approximation for the minimum tree spanning k vertices
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
An approximation algorithm for the covering Steiner problem
SODA '00 Proceedings of the eleventh 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
Approximation algorithms for the covering Steiner problem
Random Structures & Algorithms - Probabilistic methods in combinatorial optimization
Faster approximation algorithms for the minimum latency problem
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
The k-traveling repairman problem
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Approximate k-MSTs and k-Steiner Trees via the Primal-Dual Method and Lagrangean Relaxation
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
The Minimum Latency Problem Is NP-Hard for Weighted Trees
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Computing small partial coverings
Information Processing Letters
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
A Recursive Greedy Algorithm for Walks in Directed Graphs
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
Robust subgraphs for trees and paths
ACM Transactions on Algorithms (TALG)
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
The k-traveling repairmen problem
ACM Transactions on Algorithms (TALG)
Improved algorithms for orienteering and related problems
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Obtaining optimal k-cardinality trees fast
Journal of Experimental Algorithmics (JEA)
An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
Approximation algorithms for 2-source minimum routing cost k-tree problems
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part III
Subexponential algorithms for partial cover problems
Information Processing Letters
A better approximation algorithm for the budget prize collecting tree problem
Operations Research Letters
A constraint programming approach for the traveling purchaser problem
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Physical search problems with probabilistic knowledge
Artificial Intelligence
On the approximability of Dense Steiner Problems
Journal of Discrete Algorithms
| Hi-index | 0.00 |