Cost-sensitive analysis of communication protocols
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Construction of optimal graphs for bit-vector compression
SIGIR '90 Proceedings of the 13th annual international ACM SIGIR conference on Research and development in information retrieval
Compression of correlated bit-vectors
Information Systems
Approximation schemes for the restricted shortest path problem
Mathematics of Operations Research
On the hardness of approximating minimization problems
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Many birds with one stone: multi-objective approximation algorithms
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Journal of Algorithms
A threshold of ln n for approximating set cover (preliminary version)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Balancing minimum spanning and shortest path trees
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
SODA '94 Proceedings of the fifth 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
Bicriteria Network Design Problems
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
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
A deterministic algorithm for the cost-distance problem
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Proceedings of the 2003 ACM symposium on Applied computing
Timing-driven Steiner trees are (practically) free
Proceedings of the 43rd annual Design Automation Conference
Evaluating Steiner-tree heuristics and diameter variations for application layer multicast
Computer Networks: The International Journal of Computer and Telecommunications Networking
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Approximation Algorithms for Key Management in Secure Multicast
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Novel Deterministic Heuristics for Building Minimum Spanning Trees with Constrained Diameter
PReMI '09 Proceedings of the 3rd International Conference on Pattern Recognition and Machine Intelligence
An approximation algorithm for directed shallow Steiner trees
Proceedings of the 3rd International Conference on Information and Communication Systems
| Hi-index | 0.00 |