STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane
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 for the k-MST problem in the plane
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
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
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Efficient recovery from power outage (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Online througput-competitive algorithm for multicast routing and admission control
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for directed Steiner problems
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
An approximation algorithm for the covering Steiner problem
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
A 2 + ε approximation algorithm for the k-MST 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
On Salesmen, Repairmen, Spiders, and Other Traveling Agents
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
Service-constrained network design problems
Nordic Journal of Computing
Algorithms for the on-line quota traveling salesman problem
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
The online Prize-Collecting Traveling Salesman Problem
Information Processing Letters
A Constant Factor Approximation for Minimum λ-Edge-Connected k-Subgraph with Metric Costs
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Obtaining optimal k-cardinality trees fast
Journal of Experimental Algorithmics (JEA)
Approximating buy-at-bulk and shallow-light k-Steiner trees
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
| Hi-index | 0.00 |