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
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 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
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for geometric tour and network design problems (extended abstract)
Proceedings of the eleventh annual symposium on Computational geometry
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
Online algorithms for selective multicast and maximal dense trees
STOC '97 Proceedings of the twenty-ninth 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
Online througput-competitive algorithm for multicast routing and admission control
Proceedings of the ninth 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 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
Local search algorithms for the k-cardinality tree problem
Discrete Applied Mathematics
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
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)
IEEE Transactions on Pattern Analysis and Machine Intelligence
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)
Traveling salesman problem of segments
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
| Hi-index | 0.00 |