Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
The point-to-point delivery and connection problems: complexity and algorithms
Discrete Applied Mathematics
On the point-to-point connection problem
Information Processing Letters
Fixed-Parameter Tractability and Completeness I: Basic Results
SIAM Journal on Computing
The point-to-point connection problem—analysis and algorithms
Discrete Applied Mathematics
Design networks with bounded pairwise distance
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Approximation algorithms for directed Steiner problems
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
K-pair delay constrained minimum cost routing in undirected networks
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Picking alignments from (steiner) trees
Proceedings of the sixth annual international conference on Computational biology
Energy efficient communication in ad hoc networks from user's and designer's perspective
ACM SIGMOBILE Mobile Computing and Communications Review
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
Tight approximation algorithm for connectivity augmentation problems
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
The k-path tree matroid and its applications to survivable network design
Discrete Optimization
| Hi-index | 0.00 |
We prove that the problem is polynomially solvable if p is any constant number, even if nodes and edges in G are weighted and the goal is to minimize the total weight of the subgraph H.In addition, we give an efficient algorithm for the Strongly Connected Steiner Subgraph problem for any constant p, where given a directed graph and p nodes in the graph, one has to compute the smallest strongly connected subgraph containing the p nodes.