Integrality ratio for group Steiner trees and directed steiner trees
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Multi-embedding and path approximation of metric spaces
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Lower Bounds for Embedding Graphs into Graphs of Smaller Characteristic
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
A tight bound on approximating arbitrary metrics by tree metrics
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Polylogarithmic inapproximability
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
A general approach to online network optimization problems
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A fast approximation scheme for fractional covering problems with variable upper bounds
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A tight bound on approximating arbitrary metrics by tree metrics
Journal of Computer and System Sciences - Special issue: STOC 2003
On network design problems: fixed cost flows and the covering steiner problem
ACM Transactions on Algorithms (TALG)
A Recursive Greedy Algorithm for Walks in Directed Graphs
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
A near-tight approximation lower bound and algorithm for the kidnapped robot problem
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Planning Tours of Robotic Arms among Partitioned Goals
International Journal of Robotics Research
A greedy approximation algorithm for the group Steiner problem
Discrete Applied Mathematics
Finding and approximating top-k answers in keyword proximity search
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Some formulations for the group steiner tree problem
Discrete Applied Mathematics - Special issue: Traces of the Latin American conference on combinatorics, graphs and applications: a selection of papers from LACGA 2004, Santiago, Chile
A general approach to online network optimization problems
ACM Transactions on Algorithms (TALG)
Multiple Sequence Alignment as a Facility-Location Problem
INFORMS Journal on Computing
On the partial terminal Steiner tree problem
The Journal of Supercomputing
Set connectivity problems in undirected graphs and the directed Steiner network problem
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Markov convexity and local rigidity of distorted metrics
Proceedings of the twenty-fourth annual symposium on Computational geometry
The Set Connector Problem in Graphs
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Approximation algorithms for group prize-collecting and location-routing problems
Discrete Applied Mathematics
Improved approximating algorithms for Directed Steiner Forest
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Finding a team of experts in social networks
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
The Design of Competitive Online Algorithms via a Primal: Dual Approach
Foundations and Trends® in Theoretical Computer Science
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
Approximating sensor network queries using in-network summaries
IPSN '09 Proceedings of the 2009 International Conference on Information Processing in Sensor Networks
A greedy approximation algorithm for the group Steiner problem
Discrete Applied Mathematics
Computers and Operations Research
A polylogarithmic approximation for computing non-metric terminal Steiner trees
Information Processing Letters
Approximation algorithms for optimal decision trees and adaptive TSP problems
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Set connectivity problems in undirected graphs and the directed steiner network problem
ACM Transactions on Algorithms (TALG)
Providing built-in keyword search capabilities in RDBMS
The VLDB Journal — The International Journal on Very Large Data Bases
Approximating directed buy-at-bulk network design
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Approximating k-generalized connectivity via collapsing HSTs
Journal of Combinatorial Optimization
Nearest keyword search in XML documents
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
Network-design with degree constraints
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Improved approximation algorithms for Directed Steiner Forest
Journal of Computer and System Sciences
Approximation algorithms for euclidean group TSP
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Approximating fault-tolerant group-Steiner problems
Theoretical Computer Science
Multicommodity facility location under group Steiner access cost
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
The polymatroid steiner problems
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
On trip planning queries in spatial databases
SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases
On approximating the TSP with intersecting neighborhoods
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Nearly complete graphs decomposable into large induced matchings and their applications
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Note: The relation of Connected Set Cover and Group Steiner Tree
Theoretical Computer Science
Proceedings of the thirteenth ACM international symposium on Mobile Ad Hoc Networking and Computing
Complexity of minimum corridor guarding problems
Information Processing Letters
Stochastic vehicle routing with recourse
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Minimum latency submodular cover
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
On some network design problems with degree constraints
Journal of Computer and System Sciences
Watchman routes for lines and line segments
Computational Geometry: Theory and Applications
A Survey of Parallel and Distributed Algorithms for the Steiner Tree Problem
International Journal of Parallel Programming
| Hi-index | 0.00 |