On the approximation of maximum satisfiability
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Aligning sequences via an evolutionary tree: complexity and approximation
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
When Hamming meets Euclid: the approximability of geometric TSP and MST (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
The approximability of NP-hard problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Proof verification and the hardness of approximation problems
Journal of the ACM (JACM)
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
Journal of the ACM (JACM)
A 1.598 approximation algorithm for the Steiner problem in graphs
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for directed Steiner problems
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Strengthening integrality gaps for capacitated network design and covering problems
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Improved Steiner tree approximation in graphs
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Online multicast routing with bandwidth guarantees: a new approach using multicast network flow
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Optimally cutting a surface into a disk
Proceedings of the eighteenth annual symposium on Computational geometry
On the terminal Steiner tree problem
Information Processing Letters
Steiner trees in uniformly quasi-bipartite graphs
Information Processing Letters
Methods for reconstructing the history of tandem repeats and their application to the human genome
Journal of Computer and System Sciences - Computational biology 2002
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Approximate k-MSTs and k-Steiner Trees via the Primal-Dual Method and Lagrangean Relaxation
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
On the Approximability of the Steiner Tree Problem
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Approximation Hardness of the Steiner Tree Problem on Graphs
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Approximating Multicast Congestion
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
The Full Steiner Tree Problem in Phylogeny
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Lower Bounds for Approximation Algorithms for the Steiner Tree Problem
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
On the approximability of the Steiner tree problem
Theoretical Computer Science - Mathematical foundations of computer science
Online multicast routing with bandwidth guarantees: a new approach using multicast network flow
IEEE/ACM Transactions on Networking (TON)
Theoretical Computer Science
Models of greedy algorithms for graph problems
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for network design with metric costs
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
A Hard Dial-a-Ride Problem that is Easy on Average
Journal of Scheduling
Approximation algorithm for bottleneck steiner tree problem in the euclidean plane
Journal of Computer Science and Technology
A greedy approximation algorithm for the group Steiner problem
Discrete Applied Mathematics
Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Approximation via cost sharing: Simpler and better approximation algorithms for network design
Journal of the ACM (JACM)
On the partial terminal Steiner tree problem
The Journal of Supercomputing
Improved bounds for the online steiner tree problem in graphs of bounded edge-asymmetry
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
An efficient cost-sharing mechanism for the prize-collecting Steiner forest problem
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
A polynomial-time approximation scheme for Steiner tree in planar graphs
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Algorithms for terminal Steiner trees
Theoretical Computer Science
Approximating connected facility location problems via random facility sampling and core detouring
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Network design for vertex connectivity
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
The Steiner tree problem on graphs: Inapproximability results
Theoretical Computer Science
Connections in Networks: Hardness of Feasibility Versus Optimality
CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Approximating Alternative Solutions
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Reoptimization of Steiner Trees
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Faster Steiner Tree Computation in Polynomial-Space
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Discrete Applied Mathematics
An O(n log n) approximation scheme for Steiner tree in planar graphs
ACM Transactions on Algorithms (TALG)
Heuristics for Mobile Object Tracking Problem in Wireless Sensor Networks
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Reoptimization of Steiner trees: Changing the terminal set
Theoretical Computer Science
1.25-Approximation Algorithm for Steiner Tree Problem with Distances 1 and 2
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
A near linear time approximation scheme for Steiner tree among obstacles in the plane
Computational Geometry: Theory and Applications
A greedy approximation algorithm for the group Steiner problem
Discrete Applied Mathematics
On the internal steiner tree problem
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
On the hardness of reoptimization
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
New geometry-inspired relaxations and algorithms for the metric steiner tree problem
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth
Proceedings of the forty-second ACM symposium on Theory of computing
An improved LP-based approximation for steiner tree
Proceedings of the forty-second ACM symposium on Theory of computing
Connected facility location via random facility sampling and core detouring
Journal of Computer and System Sciences
A survey of approximation algorithms for multicast congestion problems
TELE-INFO'06 Proceedings of the 5th WSEAS international conference on Telecommunications and informatics
Regular language constrained sequence alignment revisited
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Improved approximations for hard optimization problems via problem instance classification
Rainbow of computer science
Knowing all optimal solutions does not help for TSP reoptimization
Computation, cooperation, and life
Dealing with large hidden constants: engineering a planar steiner tree PTAS
Journal of Experimental Algorithmics (JEA)
Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
Journal of the ACM (JACM)
An improved approximation algorithm for the terminal Steiner tree problem
ICCSA'11 Proceedings of the 2011 international conference on Computational science and its applications - Volume Part III
Faster algorithm for optimum Steiner trees
Information Processing Letters
Strict Cost Sharing Schemes for Steiner Forest
SIAM Journal on Computing
Applications of the linear matroid parity algorithm to approximating steiner trees
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
An efficient polynomial-time approximation scheme for Steiner forest in planar graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
A faster algorithm for the steiner tree problem
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
The node-weighted steiner problem in graphs of restricted node weights
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
From primal-dual to cost shares and back: a stronger LP relaxation for the steiner forest problem
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Algorithms for terminal steiner trees
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Packing trees in communication networks
WINE'05 Proceedings of the First international conference on Internet and Network Economics
MAX-SNP hardness and approximation of selected-internal steiner trees
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Euclidean prize-collecting steiner forest
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
On routing in VLSI design and communication networks
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Approximation schemes for node-weighted geometric steiner tree problems
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Steiner tree reoptimization in graphs with sharpened triangle inequality
Journal of Discrete Algorithms
Implementation of approximation algorithms for the multicast congestion problem
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Designing hypergraph layouts to GMPLS routing strategies
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
The steiner tree reoptimization problem with sharpened triangle inequality
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Prize-Collecting steiner network problems
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Contraction-based steiner tree approximations in practice
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Matroids and integrality gaps for hypergraphic steiner tree relaxations
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
GMPLS label space minimization through hypergraph layouts
Theoretical Computer Science
Minimum certificate dispersal with tree structures
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Improved Steiner tree algorithms for bounded treewidth
Journal of Discrete Algorithms
New advances in reoptimizing the minimum steiner tree problem
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Prize-collecting steiner network problems
ACM Transactions on Algorithms (TALG)
A near linear time approximation scheme for steiner tree among obstacles in the plane
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
The internal Steiner tree problem: Hardness and approximations
Journal of Complexity
Improved bounds on the price of stability in network cost sharing games
Proceedings of the fourteenth ACM conference on Electronic commerce
Exponential approximation schemata for some network design problems
Journal of Discrete Algorithms
On the low-dimensional Steiner minimum tree problem in Hamming metric
Theoretical Computer Science
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.90 |