Query Relaxation by Structure and Semantics for Retrieval of Logical Web Documents
IEEE Transactions on Knowledge and Data Engineering
TSP with Neighborhoods of Varying Size
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
TSP with neighborhoods of varying size
Journal of Algorithms
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
Playing push vs pull: models and algorithms for disseminating dynamic data in networks
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
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 system for query-specific document summarization
CIKM '06 Proceedings of the 15th ACM international conference on Information and knowledge management
The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches
Computational Optimization and Applications
Efficient algorithms for exact ranked twig-pattern matching over graphs
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
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
Practical and effective IR-style keyword search over semantic web
Information Processing and Management: an International Journal
MCN: A New Semantics Towards Effective XML Keyword Search
DASFAA '09 Proceedings of the 14th International Conference on Database Systems for Advanced Applications
Finding a team of experts in social networks
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
On the minimum corridor connection problem and other generalized geometric problems
Computational Geometry: Theory and Applications
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
A greedy approximation algorithm for the group Steiner problem
Discrete Applied Mathematics
TSP with neighborhoods of varying size
Journal of Algorithms
A fast approximation algorithm for TSP with neighborhoods and red-blue separation
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Approximating k-generalized connectivity via collapsing HSTs
Journal of Combinatorial Optimization
Learning to rank results in relational keyword search
Proceedings of the 20th ACM international conference on Information and knowledge management
Skynets: searching for minimum trees in graphs with incomparable edge weights
Proceedings of the 20th ACM international conference on Information and knowledge management
Near Optimal Bounds for Steiner Trees in the Hypercube
SIAM Journal on Computing
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
Provisioning a virtual private network under the presence of non-communicating groups
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
On approximating the TSP with intersecting neighborhoods
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
On the minimum corridor connection problem and other generalized geometric problems
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Note: The relation of Connected Set Cover and Group Steiner Tree
Theoretical Computer Science
Complexity of minimum corridor guarding problems
Information Processing Letters
Low cost data gathering using mobile hybrid sensor networks
ADHOC-NOW'12 Proceedings of the 11th international conference on Ad-hoc, Mobile, and Wireless Networks
Intelligent menu planning: recommending set of recipes by ingredients
Proceedings of the ACM multimedia 2012 workshop on Multimedia for cooking and eating activities
Incorporating compactness to generate term-association view snippets for ontology search
Information Processing and Management: an International Journal
Watchman routes for lines and line segments
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |