Beyond Steiner's problem: a VLSI oriented generalization
WG '89 Proceedings of the fifteenth international workshop on Graph-theoretic concepts in computer science
Bounds on the quality of approximate solutions to the group Steiner problem
WG '90 Proceedings of the 16th international workshop on Graph-theoretic concepts in computer science
Improved approximations for the Steiner tree problem
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
A faster approximation algorithm for the Steiner tree problem in graphs
Information Processing Letters
A threshold of ln n for approximating set cover (preliminary version)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
The Complexity of Approximating the Class Steiner Tree Problem
The Complexity of Approximating the Class Steiner Tree Problem
Rounding via trees: deterministic approximation algorithms for group Steiner trees and k-median
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
A polylogarithmic approximation algorithm for the group Steiner tree problem
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Requirements for models of achievable routing
ISPD '00 Proceedings of the 2000 international symposium on Physical design
Improved approximation bounds for the group Steiner problem
Proceedings of the conference on Design, automation and test in Europe
Retrieving and organizing web pages by “information unit”
Proceedings of the 10th international conference on World Wide Web
Query Relaxation by Structure and Semantics for Retrieval of Logical Web Documents
IEEE Transactions on Knowledge and Data Engineering
A greedy approximation algorithm for the group Steiner problem
Discrete Applied Mathematics
Complexity of the minimum-length corridor problem
Computational Geometry: Theory and Applications
The Set Connector Problem in Graphs
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
A greedy approximation algorithm for the group Steiner problem
Discrete Applied Mathematics
Approximating corridors and tours via restriction and relaxation techniques
ACM Transactions on Algorithms (TALG)
Approximating k-generalized connectivity via collapsing HSTs
Journal of Combinatorial Optimization
Complexity of minimum corridor guarding problems
Information Processing Letters
| Hi-index | 0.00 |