Randomized rounding: a technique for provably good algorithms and algorithmic proofs
Combinatorica - Theory of Computing
There are planar graphs almost as good as the complete graph
Journal of Computer and System Sciences
Beyond Steiner's problem: a VLSI oriented generalization
WG '89 Proceedings of the fifteenth international workshop on Graph-theoretic concepts in computer science
Bounds on the quality of approximate solutions to the group Steiner problem
WG '90 Proceedings of the 16th international workshop on Graph-theoretic concepts in computer science
The rectilinear class Steiner tree problem for intervals on two parallel lines
Mathematical Programming: Series A and B
A nearly best-possible approximation algorithm for node-weighted Steiner trees
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
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Improved low-degree testing and its applications
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Provably good routing tree construction with multi-port terminals
Proceedings of the 1997 international symposium on Physical design
Service-Constrained Network Design Problems
SWAT '96 Proceedings of the 5th Scandinavian Workshop on Algorithm Theory
The Complexity of Approximating the Class Steiner Tree Problem
WG '91 Proceedings of the 17th International Workshop
On Shortest Networks for Classes of Points in the Plane
CG '91 Proceedings of the International Workshop on Computational Geometry - Methods, Algorithms and Applications
Service-constrained network design problems
Nordic Journal of Computing
Polynomial time approximation schemes for Euclidean TSP and other geometric problems
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Probabilistic approximation of metric spaces and its algorithmic applications
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Rounding via trees: deterministic approximation algorithms for group Steiner trees and k-median
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
On approximating arbitrary metrices by tree metrics
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
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
An approximation algorithm for the covering Steiner problem
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
On the red-blue set cover problem
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
New approaches to covering and packing problems
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Retrieving and organizing web pages by “information unit”
Proceedings of the 10th international conference on World Wide Web
An approximation algorithm for the group Steiner problem
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for the covering Steiner problem
Random Structures & Algorithms - Probabilistic methods in combinatorial optimization
Query Relaxation by Structure and Semantics for Retrieval of Logical Web Documents
IEEE Transactions on Knowledge and Data Engineering
Embedding k-outerplanar graphs into ℓ1
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Building Edge-Failure Resilient Networks
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
On Network Design Problems: Fixed Cost Flows and the Covering Steiner Problem
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Approximation Algorithms for the Traveling Purchaser Problem and its Variants in Network Design
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Meet and merge: approximation algorithms for confluent flows
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Cuts, Trees and -Embeddings of Graphs
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Improved embeddings of graph metrics into random trees
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Meet and merge: Approximation algorithms for confluent flows
Journal of Computer and System Sciences - Special issue on network algorithms 2005
The NP-completeness column: The many limits on approximation
ACM Transactions on Algorithms (TALG)
Practical and effective IR-style keyword search over semantic web
Information Processing and Management: an International Journal
A QPTAS for TSP with fat weakly disjoint neighborhoods in doubling metrics
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Tree embeddings for two-edge-connected network design
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Online team formation in social networks
Proceedings of the 21st international conference on World Wide Web
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
Improved LP-rounding approximation algorithm for k-level uncapacitated facility location
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Embedding paths into trees: VM placement to minimize congestion
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
On the approximability of Dense Steiner Problems
Journal of Discrete Algorithms
| Hi-index | 0.00 |