The steiner problem with edge lengths 1 and 2,
Information Processing Letters
Improved approximations for the Steiner tree problem
SODA selected papers from the third annual ACM-SIAM symposium on Discrete algorithms
SIAM Journal on Computing
On wirelength estimations for row-based placement
ISPD '98 Proceedings of the 1998 international symposium on Physical design
A 1.598 approximation algorithm for the Steiner problem in graphs
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
On the bidirected cut relaxation for the metric Steiner tree problem
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
RNC-Approximation Algorithms for the Steiner Problem
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
Polynomial time approximation schemes for Euclidean TSP and other geometric problems
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Better approximation bounds for the network and Euclidean Steiner tree problems
Better approximation bounds for the network and Euclidean Steiner tree problems
Practical approximation algorithms for zero- and bounded-skew trees
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Provisioning a virtual private network: a network design problem for multicommodity flow
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
On the terminal Steiner tree problem
Information Processing Letters
Steiner trees in uniformly quasi-bipartite graphs
Information Processing Letters
Integrated Logistics: Approximation Algorithms Combining Facility Location and Network Design
Proceedings of the 9th 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
Improved approximations for tour and tree covers
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
Approximation algorithms for a capacitated network design problem
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
Primal-Dual Algorithms for Connected Facility Location Problems
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
On Approximability of the Independent/Connected Edge Dominating Set Problems
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
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
Polynomial time algorithms for network information flow
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Simpler and better approximation algorithms for network design
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Near-optimal network design with selfish agents
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
On Rajagopalan and Vazirani's 3/2-approximation bound for the Iterated 1-Steiner heuristic
Information Processing Letters
A note on the terminal Steiner tree problem
Information Processing Letters
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Trade-offs on the location of the core node in a network
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Resource optimization in QoS multicast routing of real-time multimedia
IEEE/ACM Transactions on Networking (TON)
Boosted sampling: approximation algorithms for stochastic optimization
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Online algorithms for network design
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Minimum-power multicast routing in static ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
Truthful multicast routing in selfish wireless networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Algorithmic aspects of topology control problems for ad hoc networks
Mobile Networks and Applications
Approximation techniques for utilitarian mechanism design
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Minimum power configuration in wireless sensor networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Towards truthful mechanisms for binary demand games: a general framework
Proceedings of the 6th ACM conference on Electronic commerce
An improved approximation algorithm for virtual private network design
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Energy-conserving data cache placement in sensor networks
ACM Transactions on Sensor Networks (TOSN)
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
On achieving maximum multicast throughput in undirected networks
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Dynamic data fusion for future sensor networks
ACM Transactions on Sensor Networks (TOSN)
Complexity of Searching for a Black Hole
Fundamenta Informaticae
A factoring approach for the Steiner tree problem in undirected networks
Information Sciences: an International Journal
Minimum power configuration for wireless communication in sensor networks
ACM Transactions on Sensor Networks (TOSN)
Maximizing total upload in latency-sensitive P2P applications
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Energy-aware multicasting in wireless ad hoc networks: A survey and discussion
Computer Communications
Note: Approximating the selected-internal Steiner tree
Theoretical Computer Science
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
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Demand-scalable geographic multicasting in wireless sensor networks
Computer Communications
An improved approximation algorithm for capacitated multicast routings in networks
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
Inapproximability and approximability of minimal tree routing and coloring
Journal of Discrete Algorithms
Approximation algorithms for a facility location problem with service capacities
ACM Transactions on Algorithms (TALG)
On routing in VLSI design and communication networks
Discrete Applied Mathematics
The Steiner tree problem on graphs: Inapproximability results
Theoretical Computer Science
Efficient Data Collection and Selective Queries in Sensor Networks
GeoSensor Networks
Aggregating Robots Compute: An Adaptive Heuristic for the Euclidean Steiner Tree Problem
SAB '08 Proceedings of the 10th international conference on Simulation of Adaptive Behavior: From Animals to Animats
Approximating Alternative Solutions
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
(1 + ρ)-Approximation for Selected-Internal Steiner Minimum Tree
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Approximating the Generalized Capacitated Tree-Routing Problem
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
Improved Primal-Dual Approximation Algorithm for the Connected Facility Location Problem
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Two Constant Approximation Algorithms for Node-Weighted Steiner Tree in Unit Disk Graphs
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Faster Steiner Tree Computation in Polynomial-Space
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Two-Stage Robust Network Design with Exponential Scenarios
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes
Graph-Theoretic Concepts in Computer Science
Discrete Applied Mathematics
Combinatorics, Probability and Computing
Approximation Algorithms for Multicast Routings in a Network with Multi-Sources
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Improved approximation algorithms for the single-sink buy-at-bulk network design problems
Journal of Discrete Algorithms
Optimizing Many-to-Many Data Aggregation in Wireless Sensor Networks
APWeb/WAIM '09 Proceedings of the Joint International Conferences on Advances in Data and Web Management
Continually answering constraint k-NN queries in unstructured P2P systems
Journal of Computer Science and Technology
A reactive role assignment for data routing in event-based wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
A PTAS for Node-Weighted Steiner Tree in Unit Disk Graphs
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Approaches to the Steiner Problem in Networks
Algorithmics of Large and Complex Networks
Multicast Routing and Design of Sparse Connectors
Algorithmics of Large and Complex Networks
Reoptimization of Steiner trees: Changing the terminal set
Theoretical Computer Science
Approximating node-weighted multicast trees in wireless ad-hoc networks
Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
Adaptive aggregation tree transformation for energy-efficient query processing in sensor networks
International Journal of Sensor Networks
A 3.4713-approximation algorithm for the capacitated multicast tree routing problem
Theoretical Computer Science
A reliable and data aggregation aware routing protocol for wireless sensor networks
Proceedings of the 12th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
Trees of shortest paths vs. Steiner trees: understanding and improving delete relaxation heuristics
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
A near linear time approximation scheme for Steiner tree among obstacles in the plane
Computational Geometry: Theory and Applications
Topology control in constant rate mobile ad hoc networks
Wireless Networks
On the full and bottleneck full Steiner tree problems
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Fast approximation of minimum multicast congestion: implementation versus theory
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
On the internal steiner tree problem
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Approximating capacitated tree-routings in networks
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Placing and maintaining a core node in wireless ad hoc sensor networks
NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
Approximation to the minimum cost edge installation problem
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
On the hardness of reoptimization
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
On the approximation of the generalized capacitated tree-routing problem
Journal of Discrete Algorithms
Genetic algorithms with immigrants schemes for dynamic multicast problems in mobile ad hoc networks
Engineering Applications of Artificial Intelligence
Theoretical Computer Science
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Approximating fault-tolerant Steiner subgraphs in heterogeneous wireless networks
Proceedings of the 6th International Wireless Communications and Mobile Computing Conference
Connected facility location via random facility sampling and core detouring
Journal of Computer and System Sciences
A scalable and dynamic data aggregation aware routing protocol for wireless sensor networks
Proceedings of the 13th ACM international conference on Modeling, analysis, and simulation of wireless and mobile systems
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
Multicast routing in multi-radio multi-channel wireless mesh networks
IEEE Transactions on Wireless Communications
Size-constrained tree partitioning: Approximating the multicast k-tree routing problem
Theoretical Computer Science
Providing built-in keyword search capabilities in RDBMS
The VLDB Journal — The International Journal on Very Large Data Bases
Approximating capacitated tree-routings in networks
Journal of Combinatorial Optimization
Diameter-constrained steiner tree
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Energy-efficient roadside unit scheduling for maintaining connectivity in vehicle ad-hoc network
Proceedings of the 5th International Conference on Ubiquitous Information Management and Communication
Efficient congestion mitigation using congestion-aware steiner trees and network coding topologies
VLSI Design - Special issue on CAD for Gigascale SoC Design and Verification Solutions
On the euclidean bottleneck full Steiner tree problem
Proceedings of the twenty-seventh annual symposium on Computational geometry
On the low-dimensional steiner minimum tree problem in hamming metric
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
Dealing with large hidden constants: engineering a planar steiner tree PTAS
Journal of Experimental Algorithmics (JEA)
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
Wireless Personal Communications: An International Journal
Skynets: searching for minimum trees in graphs with incomparable edge weights
Proceedings of the 20th ACM international conference on Information and knowledge management
Adaptive Uncertainty Resolution in Bayesian Combinatorial Optimization Problems
ACM Transactions on Algorithms (TALG)
Improved approximation algorithms for Directed Steiner Forest
Journal of Computer and System Sciences
Strict Cost Sharing Schemes for Steiner Forest
SIAM Journal on Computing
Improved Approximation Algorithms for Prize-Collecting Steiner Tree and TSP
SIAM Journal on Computing
Sampling and Cost-Sharing: Approximation Algorithms for Stochastic Optimization Problems
SIAM Journal on Computing
Traffic-redundancy aware network design
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
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
Approximation of octilinear steiner trees constrained by hard and soft obstacles
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
How well can primal-dual and local-ratio algorithms perform?
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
New approaches for virtual private network design
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Defending against distance cheating in link-weighted application-layer multicast
IEEE/ACM Transactions on Networking (TON)
Improved approximation algorithms for the capacitated multicast routing problem
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Geometric network design with selfish agents
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Bicriteria network design via iterative rounding
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Share the multicast payment fairly
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Algorithms for terminal steiner trees
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Simple distributed algorithms for approximating minimum steiner trees
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
MAX-SNP hardness and approximation of selected-internal steiner trees
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Hardness and approximation of octilinear steiner trees
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Approximation algorithms for network design and facility location with service capacities
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
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
Design diffserv multicast with selfish agents
AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
On the minimization of the number of forwarding nodes for multicast in wireless ad hoc networks
ICCNMC'05 Proceedings of the Third international conference on Networking and Mobile Computing
Steiner tree reoptimization in graphs with sharpened triangle inequality
Journal of Discrete Algorithms
Bounding the payment of approximate truthful mechanisms
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Implementation of approximation algorithms for the multicast congestion problem
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Free-riders in steiner tree cost-sharing games
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
On fair and optimal multi-source IP-multicast
Computer Networks: The International Journal of Computer and Telecommunications Networking
A (4+ε)-approximation for the minimum-weight dominating set problem in unit disk graphs
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Algorithms on graphs with small dominating targets
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
The steiner tree reoptimization problem with sharpened triangle inequality
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Contraction-based steiner tree approximations in practice
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Optimal configuration of an optical network providing predefined multicast transmissions
Computer Networks: The International Journal of Computer and Telecommunications Networking
Approximation Techniques for Utilitarian Mechanism Design
SIAM Journal on Computing
New advances in reoptimizing the minimum steiner tree problem
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Complexity of Searching for a Black Hole
Fundamenta Informaticae
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
The internal Steiner tree problem: Hardness and approximations
Journal of Complexity
Steiner Tree Approximation via Iterative Randomized Rounding
Journal of the ACM (JACM)
Improved bounds on the price of stability in network cost sharing games
Proceedings of the fourteenth ACM conference on Electronic commerce
On the approximability of Dense Steiner Problems
Journal of Discrete Algorithms
On the low-dimensional Steiner minimum tree problem in Hamming metric
Theoretical Computer Science
Minimum diameter cost-constrained Steiner trees
Journal of Combinatorial Optimization
The density maximization problem in graphs
Journal of Combinatorial Optimization
A Survey of Parallel and Distributed Algorithms for the Steiner Tree Problem
International Journal of Parallel Programming
| Hi-index | 0.01 |